buc.ci is a Fediverse instance that uses the ActivityPub protocol. In other words, users at this host can communicate with people that use software like Mastodon, Pleroma, Friendica, etc. all around the world.
This server runs the snac software and there is no automatic sign-up process.
Here's a version of the chart showing all decks with symbol tables, not just those referencing the #FORTRAN library. It looks like symbolic linking of any kind came in with FORTRAN II in 1958/9.
#retrocomputing #vintagecomputing #computerhistory #computerarcheology
I made a graph of the distribution of programs in the #SHARE library which have symbol tables referring to the #FORTRAN standard library. The orange ones are likely to be red herrings - lots of random trig functions, etc. on the tapes, so name clashes are very likely.
The FORTRAN release lines aren't quite right - they're the mid-point of the years, and I don't know the actual dates. I believe FORTRAN II was shipped in late 1958 / early 1959, and the programs start appearing at about the same time - I guess maybe implying that the library didn't ship with FORTRAN I.
I've also now concluded that the YALE1 tape isn't the same as the others - I think it's programs which were deleted from the main tapes. The entries on YALE1 don't have timestamps, but the catalogue numbers span a fairly large range. There's only one program on YALE1 with FORTRAN symbols, and based on the catalogue number it would be from around May 1959. I'm fairly sure that we therefore have reliable dates right back to 1957, which means that the lack of programs to the left of the graph is probably real.
#retrocomputing #vintagecomputing #computerhistory #computerarcheology
I've been looking at the binary deck format for the #SHARE tapes in more detail. It's fairly well documented, is actually quite consistent, and seems to have evolved only slowly over the relevant period.
One thing it has enabled me to do is to do a better job of looking for cards which appear verbatim in multiple places in the library, e.g. bootloaders and other library code. I've made some progress, but I need to find a good way to visualise my findings, as it's quite chaotic at the moment.
More concretely, I've been able to find binary decks which include symbol tables and extract them: https://philcowans.com/symbol_tables.txt. Some of the entries are clearly junk (there will be some spurious matches in e.g. binary data), but most aren't. I suspect there's a character set issue, and things like "?BDC)" should really be "(BDC)". I've looked at a few examples where I do have source code, and (unlike the regular entries) the entries in parentheses don't appear in those, so they must mean something special, but I'm not sure what. I recall something similar from CTSS, so that's a possible thread to follow. I believe that "000000" means "main", i.e. the initial entry point to the programme, although I'm not sure that this is used by the bootloaders, which I think use transfer cards instead.
The library spans the period when symbolic linking first appeared, I think in #FORTRAN II (1959), but I need to check. Most of the examples I've looked are from FORTRAN, but I've found at least one assembly programme with a hand crafted symbol table. I'd like to do some analysis of the evolution of the decks by date, but I don't yet have the dates in a file format which can easily be joined with the rest of the output from my scripts.
#retrocomputing #vintagecomputing #computerhistory #computerarcheology
Does anyone have the NBS Special Publication 399 (SP399) NBS FORTRAN Test Programs for Fortran-66 in machine-readable form? Scans of the printed listings are online, though as typical with scans, there are some errors introduced, e.g., truncated lines on Volume 2 page 10.
The tape is no longer available from NIST, but was, AFAICT, freely redistributable.
1/
#FORTRAN
When I say passable: in graduate school I wrote a Prolog interpreter in java (including parsing source code or REPL input), within which I could run the classic examples like append or (very simple) symbolic differentiation/integration. As an undergraduate I wrote a Mathematica program to solve the word recognition problem for context-free formal languages. But I'd need some study time to be able to write these languages again.
I don't know what the hell prompted me to reminisce about programming languages. I hope it doesn't come off as a humblebrag but rather like old guy spinning yarns. I think I've been through so many because I'm never quite happy with any one of them and because I've had a varied career that started when I was pretty young.
I guess I'm also half hoping to find people on here who have similar interests so I'm going to riddle this post with hashtags:
#Coding #SoftwareDevelopment #ProgrammingLanguages #8086Assembly #BASIC #C #Pascal #perl #java #scala #LISP #Scheme #Prolog #Mathematica #ObjectiveC #matlab #octave #R #Python #Fortran #COBOL #Haskell #Clean #Flix #Curry #Factor #Unison #Joy #Idris #Agda #Lean #6502Assembly