Add 2 Games and a PL repository, and sort secondary entries.
This commit is contained in:
parent
fb6922d208
commit
5bfbc9d8a2
40 changed files with 136 additions and 138 deletions
|
|
@ -18,7 +18,7 @@ all of which are accessible on the World Wide Web.
|
|||
|
||||
<!-- TOTALS -->
|
||||
|
||||
Currently it consists of **693** web pages, **82** repositories, **174** papers, and **179** books in **102** topics.
|
||||
Currently it consists of **695** web pages, **83** repositories, **174** papers, and **179** books in **102** topics.
|
||||
Of these, [**110** have the highest rating](by-rating/Top-rated.md),
|
||||
[**33** are considered classics](by-rating/Classic.md),
|
||||
[**78** are considered very interesting](by-rating/Very%20Interesting.md),
|
||||
|
|
|
|||
|
|
@ -39,12 +39,12 @@ SPDX-License-Identifier: CC0-1.0
|
|||
|
||||
[lybrown/dis: Statically Tracing 6502 Disassembler](https://github.com/lybrown/dis) ★
|
||||
|
||||
_(in [Scheme](../Scheme/README.md#scheme))_ [scotws/Cthulhu-Scheme: A primitive bare-metal Scheme for the 65c02](https://github.com/scotws/Cthulhu-Scheme) ★
|
||||
|
||||
_(in [Apple II](../Apple%20II/README.md#apple-ii))_ [dschmenk/PLASMA: Proto Language AsSeMbler for All (formerly Apple)](https://github.com/dschmenk/PLASMA) ★
|
||||
|
||||
_(in [Forth](../Forth/README.md#forth))_ [scotws/TaliForth2: A Subroutine Threaded Code (STC) ANS-like Forth for the 65c02](https://github.com/scotws/TaliForth2) ★
|
||||
|
||||
_(in [Scheme](../Scheme/README.md#scheme))_ [scotws/Cthulhu-Scheme: A primitive bare-metal Scheme for the 65c02](https://github.com/scotws/Cthulhu-Scheme) ★
|
||||
|
||||
|
||||
### Books
|
||||
|
||||
|
|
|
|||
|
|
@ -18,7 +18,7 @@ SPDX-License-Identifier: CC0-1.0
|
|||
|
||||
[soft question - Why does intersection always preserve \"closed\" structures? - Mathematics Stack Exchange](https://math.stackexchange.com/questions/3602374/why-does-intersection-always-preserve-closed-structures) ★
|
||||
|
||||
_(in [Topology](../Topology/README.md#topology))_ [general topology - Topological matroids? - Mathematics Stack Exchange](https://math.stackexchange.com/questions/960007/topological-matroids) ★
|
||||
_(in [Matroid Theory](../Matroid%20Theory/README.md#matroid-theory))_ [general topology - Topological matroids? - Mathematics Stack Exchange](https://math.stackexchange.com/questions/960007/topological-matroids) ★
|
||||
|
||||
|
||||
### Books
|
||||
|
|
|
|||
|
|
@ -18,12 +18,12 @@ SPDX-License-Identifier: CC0-1.0
|
|||
|
||||
[Example assembly/machine instruction from lambda calculus](https://stackoverflow.com/questions/67594976/example-assembly-machine-instruction-from-lambda-calculus) ★★
|
||||
|
||||
_(in [Functional Programming](../Functional%20Programming/README.md#functional-programming))_ [compiler construction - Converting a function to use tail recursion -- a formal study - Stack Overflow](https://stackoverflow.com/questions/10700807/converting-a-function-to-use-tail-recursion-a-formal-study) ★
|
||||
|
||||
_(in [6502](../6502/README.md#6502))_ [COMFY-6502 compiler: port to Common Lisp](https://josephoswald.nfshost.com/comfy/summary.html) ★★
|
||||
|
||||
_(in [6502](../6502/README.md#6502))_ [cc65 - a freeware C compiler for 6502 based systems](https://cc65.github.io/) ★★
|
||||
|
||||
_(in [Functional Programming](../Functional%20Programming/README.md#functional-programming))_ [compiler construction - Converting a function to use tail recursion -- a formal study - Stack Overflow](https://stackoverflow.com/questions/10700807/converting-a-function-to-use-tail-recursion-a-formal-study) ★
|
||||
|
||||
|
||||
### Repositories
|
||||
|
||||
|
|
|
|||
|
|
@ -54,10 +54,10 @@ Interaction Trees (online @ [archive.org](https://archive.org/details/interactio
|
|||
|
||||
_(in [Calculus of Constructions](../Calculus%20of%20Constructions/README.md#calculus-of-constructions))_ [Introduction to the Calculus of Inductive Constructions](https://inria.hal.science/hal-01094195/document) ★
|
||||
|
||||
_(in [Theorem Proving](../Theorem%20Proving/README.md#theorem-proving))_ Theorem proving support in programming language semantics (online @ [arxiv.org](https://arxiv.org/abs/0707.0926)) ★
|
||||
|
||||
_(in [Term Rewriting](../Term%20Rewriting/README.md#term-rewriting))_ [A Constructive Semantics for Rewriting Logic](https://digitalcommons.uri.edu/oa_diss/268/) ★★
|
||||
|
||||
_(in [Theorem Proving](../Theorem%20Proving/README.md#theorem-proving))_ Theorem proving support in programming language semantics (online @ [arxiv.org](https://arxiv.org/abs/0707.0926)) ★
|
||||
|
||||
|
||||
### Books
|
||||
|
||||
|
|
|
|||
|
|
@ -40,10 +40,10 @@ SPDX-License-Identifier: CC0-1.0
|
|||
|
||||
[digital logic - When is it appropriate to mix 74LSxx components with original TTL 74xx? - Electrical Engineering Stack Exchange](https://electronics.stackexchange.com/questions/692617/when-is-it-appropriate-to-mix-74lsxx-components-with-original-ttl-74xx) ★
|
||||
|
||||
_(in [Numerical Analysis](../Numerical%20Analysis/README.md#numerical-analysis))_ [What numerical methods are used in circuit simulation? How can I get an overview? - Electrical Engineering Stack Exchange](https://electronics.stackexchange.com/questions/644007/what-numerical-methods-are-used-in-circuit-simulation-how-can-i-get-an-overview) ★★★
|
||||
|
||||
_(in [Energy Management](../Energy%20Management/README.md#energy-management))_ [Batteries for AA-compatible digital cameras](https://web.archive.org/web/20131121103753/http://dpfwiw.com/batteries.htm) ★
|
||||
|
||||
_(in [Numerical Analysis](../Numerical%20Analysis/README.md#numerical-analysis))_ [What numerical methods are used in circuit simulation? How can I get an overview? - Electrical Engineering Stack Exchange](https://electronics.stackexchange.com/questions/644007/what-numerical-methods-are-used-in-circuit-simulation-how-can-i-get-an-overview) ★★★
|
||||
|
||||
|
||||
### Books
|
||||
|
||||
|
|
|
|||
|
|
@ -65,7 +65,7 @@ _(in [Type Theory](../Type%20Theory/README.md#type-theory))_ [Type Theory and Ma
|
|||
|
||||
### Books
|
||||
|
||||
_(in [Mathematics](../Mathematics/README.md#mathematics))_ Compactness and Contradiction (online @ [terrytao.wordpress.com](https://terrytao.wordpress.com/wp-content/uploads/2011/06/blog-book.pdf))
|
||||
|
||||
_(in [Logic](../Logic/README.md#logic))_ Mathematical Logic (Kleene) (borrow @ [archive.org](https://archive.org/details/mathematicallogi0000klee)) 🏛️
|
||||
|
||||
_(in [Mathematics](../Mathematics/README.md#mathematics))_ Compactness and Contradiction (online @ [terrytao.wordpress.com](https://terrytao.wordpress.com/wp-content/uploads/2011/06/blog-book.pdf))
|
||||
|
||||
|
|
|
|||
|
|
@ -42,12 +42,12 @@ SPDX-License-Identifier: CC0-1.0
|
|||
|
||||
[idioms - Is \"regex\" in modern programming languages really \"context sensitive grammar\"? - Stack Overflow](https://stackoverflow.com/questions/612654/is-regex-in-modern-programming-languages-really-context-sensitive-grammar) ★
|
||||
|
||||
_(in [Automata Theory](../Automata%20Theory/README.md#automata-theory))_ [Csc520 Foundations of Computer Science](https://web.archive.org/web/20161105235418/https://www.cs.wcupa.edu/rkline/csc520) ★
|
||||
|
||||
_(in [Programming Languages](../Programming%20Languages/README.md#programming-languages))_ [GF - Grammatical Framework](https://www.grammaticalframework.org/) ★
|
||||
|
||||
_(in [Programming Languages](../Programming%20Languages/README.md#programming-languages))_ [Grammatical Framework (programming language) - Wikipedia](https://en.wikipedia.org/wiki/Grammatical_Framework_(programming_language))
|
||||
|
||||
_(in [Automata Theory](../Automata%20Theory/README.md#automata-theory))_ [Csc520 Foundations of Computer Science](https://web.archive.org/web/20161105235418/https://www.cs.wcupa.edu/rkline/csc520) ★
|
||||
|
||||
|
||||
### Papers
|
||||
|
||||
|
|
|
|||
|
|
@ -49,10 +49,10 @@ SPDX-License-Identifier: CC0-1.0
|
|||
|
||||
Syntactic Theories in Practice (online @ [tidsskrift.dk](https://tidsskrift.dk/brics/article/view/21721)) ★
|
||||
|
||||
_(in [Type Systems](../Type%20Systems/README.md#type-systems))_ Should Your Specification Language Be Typed? (online @ [lamport.azurewebsites.net](http://lamport.azurewebsites.net/pubs/lamport-types.pdf)) ★★★
|
||||
|
||||
_(in [Philosophy](../Philosophy/README.md#philosophy))_ [Tossing Algebraic Flowers down the Great Divide](https://cseweb.ucsd.edu/~goguen/pps/tcs97.pdf) ★★★
|
||||
|
||||
_(in [Type Systems](../Type%20Systems/README.md#type-systems))_ Should Your Specification Language Be Typed? (online @ [lamport.azurewebsites.net](http://lamport.azurewebsites.net/pubs/lamport-types.pdf)) ★★★
|
||||
|
||||
|
||||
### Books
|
||||
|
||||
|
|
|
|||
|
|
@ -28,12 +28,12 @@ SPDX-License-Identifier: CC0-1.0
|
|||
|
||||
[Recitation 21: Let Expressions & The Environment Model](https://www.cs.cornell.edu/courses/cs312/2004fa/lectures/rec21.html) ★
|
||||
|
||||
_(in [JavaScript](../JavaScript/README.md#javascript))_ [functional programming - How are people implementing immutable data structures in JavaScript when the language doesn't offer any obvious way of implementing immutability? - Stack Overflow](https://stackoverflow.com/questions/67758847/how-are-people-implementing-immutable-data-structures-in-javascript-when-the-lan) ★
|
||||
|
||||
_(in [Compiler Construction](../Compiler%20Construction/README.md#compiler-construction))_ [Example assembly/machine instruction from lambda calculus](https://stackoverflow.com/questions/67594976/example-assembly-machine-instruction-from-lambda-calculus) ★★
|
||||
|
||||
_(in [Game Development](../Game%20Development/README.md#game-development))_ [javascript - Immutable.js: Data structure to represent 2D game field - Stack Overflow](https://stackoverflow.com/questions/36603998/immutable-js-data-structure-to-represent-2d-game-field) ★
|
||||
|
||||
_(in [JavaScript](../JavaScript/README.md#javascript))_ [functional programming - How are people implementing immutable data structures in JavaScript when the language doesn't offer any obvious way of implementing immutability? - Stack Overflow](https://stackoverflow.com/questions/67758847/how-are-people-implementing-immutable-data-structures-in-javascript-when-the-lan) ★
|
||||
|
||||
|
||||
### Repositories
|
||||
|
||||
|
|
@ -41,14 +41,14 @@ _(in [Game Development](../Game%20Development/README.md#game-development))_ [jav
|
|||
|
||||
_(in [Compiler Construction](../Compiler%20Construction/README.md#compiler-construction))_ [natefaubion/example-functional-compiler](https://github.com/natefaubion/example-functional-compiler) ★
|
||||
|
||||
_(in [User Interface](../User%20Interface/README.md#user-interface))_ [art-w/unicorn: Purely functional GUI algebra](https://github.com/art-w/unicorn) ★★
|
||||
|
||||
_(in [Programming Languages](../Programming%20Languages/README.md#programming-languages))_ [ympbyc/Carrot: Purely functional lisp featuring: default currying, left-associative s-expression, lazy evaluation, static type system, and statically determined multimethods.](https://github.com/ympbyc/Carrot) ★★★
|
||||
|
||||
_(in [Programming Languages](../Programming%20Languages/README.md#programming-languages))_ [ncihnegn/miranda: Miranda is a pure, non-strict, polymorphic, higher order functional programming language designed by David Turner in 1983-6.](https://github.com/ncihnegn/miranda) ★
|
||||
|
||||
_(in [Programming Languages](../Programming%20Languages/README.md#programming-languages))_ [UnrealVerseGuru/VerseProgrammingLanguage: Verse Programming Language - Functional logic language developed by Epic Games - all informations, official resources and snippets](https://github.com/UnrealVerseGuru/VerseProgrammingLanguage) ★
|
||||
|
||||
_(in [User Interface](../User%20Interface/README.md#user-interface))_ [art-w/unicorn: Purely functional GUI algebra](https://github.com/art-w/unicorn) ★★
|
||||
|
||||
|
||||
### Papers
|
||||
|
||||
|
|
@ -62,10 +62,10 @@ Fast and Loose Reasoning is Morally Correct (online @ [www.cs.ox.ac.uk](https://
|
|||
|
||||
let (rec) insertion without effects, lights or magic (online @ [icfp19.sigplan.org](https://icfp19.sigplan.org/details/mlfamilyworkshop-2019-papers/6/let-rec-insertion-without-effects-lights-or-magic))
|
||||
|
||||
_(in [Type Systems](../Type%20Systems/README.md#type-systems))_ Initial Algebra Semantics is Enough! (online @ [libres.uncg.edu](https://libres.uncg.edu/ir/asu/f/Johann_Patricia_2007_Intitial%20Algebra%20Semantics%20Is%20Enough.pdf)) ★
|
||||
|
||||
_(in [Computational Complexity](../Computational%20Complexity/README.md#computational-complexity))_ Pure vs Impure Lisp (online @ [dl.acm.org](https://dl.acm.org/doi/pdf/10.1145/244795.244798))
|
||||
|
||||
_(in [Type Systems](../Type%20Systems/README.md#type-systems))_ Initial Algebra Semantics is Enough! (online @ [libres.uncg.edu](https://libres.uncg.edu/ir/asu/f/Johann_Patricia_2007_Intitial%20Algebra%20Semantics%20Is%20Enough.pdf)) ★
|
||||
|
||||
|
||||
### Books
|
||||
|
||||
|
|
|
|||
|
|
@ -34,10 +34,14 @@ SPDX-License-Identifier: CC0-1.0
|
|||
|
||||
[Organ Trail - Wikipedia](https://en.wikipedia.org/wiki/Organ_Trail)
|
||||
|
||||
[Loco-Motion (video game) - Wikipedia](https://en.wikipedia.org/wiki/Loco-Motion_(video_game))
|
||||
|
||||
[Blocksum : Shintaro Sato : Free Download, Borrow, and Streaming : Internet Archive](https://archive.org/details/Blocksum_game) ★
|
||||
|
||||
[bike](https://2bt.github.io/bike/) ★
|
||||
|
||||
[The 2nd Battalion Page](https://www.evl.uic.edu/aej/AndyBattalion.html) ★
|
||||
|
||||
_(in [Public Domain](../Public%20Domain/README.md#public-domain))_ [Llamasoft 8 bit games](https://web.archive.org/web/20070629145455/http://www.medwaypvb.com/llamadloads.htm) ★★
|
||||
|
||||
|
||||
|
|
|
|||
|
|
@ -68,6 +68,12 @@ SPDX-License-Identifier: CC0-1.0
|
|||
|
||||
.
|
||||
|
||||
### Loco-Motion (video game) - Wikipedia
|
||||
|
||||
* url: https://en.wikipedia.org/wiki/Loco-Motion_(video_game)
|
||||
|
||||
.
|
||||
|
||||
### Blocksum : Shintaro Sato : Free Download, Borrow, and Streaming : Internet Archive
|
||||
|
||||
* url: https://archive.org/details/Blocksum_game
|
||||
|
|
@ -80,3 +86,8 @@ SPDX-License-Identifier: CC0-1.0
|
|||
|
||||
.
|
||||
|
||||
### The 2nd Battalion Page
|
||||
|
||||
* url: https://www.evl.uic.edu/aej/AndyBattalion.html
|
||||
|
||||
.
|
||||
|
|
|
|||
|
|
@ -17,25 +17,7 @@ Games
|
|||
|
||||
* rating: 3
|
||||
|
||||
.
|
||||
|
||||
### DND (video game) - Wikipedia
|
||||
|
||||
* rating: TODO
|
||||
|
||||
.
|
||||
|
||||
### dnd (1975 video game) - Wikipedia
|
||||
|
||||
* rating: TODO
|
||||
|
||||
.
|
||||
|
||||
### pedit5 - Wikipedia
|
||||
|
||||
* rating: TODO
|
||||
|
||||
.
|
||||
Really I need some kind of dedicated "shameless self-promotion" "rating" instead of "3".
|
||||
|
||||
### Bridge-It (1984) \| Video Game \| VideoGameGeek
|
||||
|
||||
|
|
@ -43,36 +25,6 @@ Games
|
|||
|
||||
.
|
||||
|
||||
### Pooyan - Wikipedia
|
||||
|
||||
* rating: TODO
|
||||
|
||||
.
|
||||
|
||||
### Spelunky - Wikipedia
|
||||
|
||||
* rating: TODO
|
||||
|
||||
.
|
||||
|
||||
### Fez (video game) - Wikipedia
|
||||
|
||||
* rating: TODO
|
||||
|
||||
.
|
||||
|
||||
### Ico - Wikipedia
|
||||
|
||||
* rating: TODO
|
||||
|
||||
.
|
||||
|
||||
### Organ Trail - Wikipedia
|
||||
|
||||
* rating: TODO
|
||||
|
||||
.
|
||||
|
||||
### Blocksum : Shintaro Sato : Free Download, Borrow, and Streaming : Internet Archive
|
||||
|
||||
* rating: 1
|
||||
|
|
@ -85,3 +37,8 @@ Games
|
|||
|
||||
.
|
||||
|
||||
### The 2nd Battalion Page
|
||||
|
||||
* rating: 1
|
||||
|
||||
.
|
||||
|
|
|
|||
|
|
@ -93,14 +93,14 @@ _(in [Relational Programming](../Relational%20Programming/README.md#relational-p
|
|||
|
||||
[haskell/docker-haskell](https://github.com/haskell/docker-haskell) ★
|
||||
|
||||
_(in [Scheme](../Scheme/README.md#scheme))_ [siraben/r5rs-denot: A correct Scheme interpreter derived from the R5RS spec\'s formal semantics, written in Haskell.](https://github.com/siraben/r5rs-denot) ★★
|
||||
|
||||
_(in [Compiler Construction](../Compiler%20Construction/README.md#compiler-construction))_ [radian-software/kalyn: self-hosting compiler from a Haskell-like Lisp directly to x86-64, from scratch.](https://github.com/radian-software/kalyn) ★
|
||||
|
||||
_(in [Compiler Construction](../Compiler%20Construction/README.md#compiler-construction))_ [bollu/tiny-optimising-compiler: A tiny *optimising* compiler for an imperative programming language written in haskell](https://github.com/bollu/tiny-optimising-compiler) ★
|
||||
|
||||
_(in [Coq](../Coq/README.md#coq))_ [plclub/hs-to-coq: Convert Haskell source code to Coq source code.](https://github.com/plclub/hs-to-coq) ★
|
||||
|
||||
_(in [Scheme](../Scheme/README.md#scheme))_ [siraben/r5rs-denot: A correct Scheme interpreter derived from the R5RS spec\'s formal semantics, written in Haskell.](https://github.com/siraben/r5rs-denot) ★★
|
||||
|
||||
_(in [Unification](../Unification/README.md#unification))_ [parsonsmatt/unification: implementation of the first order logic unification algorithm in Haskell](https://github.com/parsonsmatt/unification) ★
|
||||
|
||||
_(in [Unification](../Unification/README.md#unification))_ [jozefg/higher-order-unification: A small implementation of higher-order unification](https://github.com/jozefg/higher-order-unification) ★
|
||||
|
|
|
|||
|
|
@ -24,10 +24,10 @@ SPDX-License-Identifier: CC0-1.0
|
|||
|
||||
[Burali-Forti paradox - Wikipedia, the free encyclopedia](https://en.wikipedia.org/wiki/Burali-Forti_paradox)
|
||||
|
||||
_(in [Theorem Proving](../Theorem%20Proving/README.md#theorem-proving))_ [formal methods - Do theorems provers demonstrate their own correctness\"? - Computer Science Stack Exchange](https://cs.stackexchange.com/questions/119817/do-theorems-provers-demonstrate-their-own-correctness) ★★★
|
||||
|
||||
_(in [FoM](../FoM/README.md#fom))_ [set theory - Are there first-order statements that second order PA proves that first order PA does not? - MathOverflow](https://mathoverflow.net/questions/366580/are-there-first-order-statements-that-second-order-pa-proves-that-first-order-pa) ★
|
||||
|
||||
_(in [Theorem Proving](../Theorem%20Proving/README.md#theorem-proving))_ [formal methods - Do theorems provers demonstrate their own correctness\"? - Computer Science Stack Exchange](https://cs.stackexchange.com/questions/119817/do-theorems-provers-demonstrate-their-own-correctness) ★★★
|
||||
|
||||
|
||||
### Papers
|
||||
|
||||
|
|
|
|||
|
|
@ -64,22 +64,22 @@ SPDX-License-Identifier: CC0-1.0
|
|||
|
||||
[Speed Up Your JavaScript Load Time](https://betterexplained.com/articles/speed-up-your-javascript-load-time/)
|
||||
|
||||
_(in [PLDI](../PLDI/README.md#pldi))_ [What blocks Ruby, Python to get Javascript V8 speed? - Stack Overflow](https://stackoverflow.com/questions/5168718/what-blocks-ruby-python-to-get-javascript-v8-speed) ★
|
||||
|
||||
_(in [PLDI](../PLDI/README.md#pldi))_ [Why is JavaScript not compiled to bytecode before sending over the network? - Software Engineering Stack Exchange](https://softwareengineering.stackexchange.com/questions/402250/why-is-javascript-not-compiled-to-bytecode-before-sending-over-the-network) ★
|
||||
|
||||
_(in [Game Development](../Game%20Development/README.md#game-development))_ [javascript - Immutable.js: Data structure to represent 2D game field - Stack Overflow](https://stackoverflow.com/questions/36603998/immutable-js-data-structure-to-represent-2d-game-field) ★
|
||||
|
||||
_(in [Lua](../Lua/README.md#lua))_ [Fengari](https://fengari.io/) ★
|
||||
|
||||
_(in [PLDI](../PLDI/README.md#pldi))_ [What blocks Ruby, Python to get Javascript V8 speed? - Stack Overflow](https://stackoverflow.com/questions/5168718/what-blocks-ruby-python-to-get-javascript-v8-speed) ★
|
||||
|
||||
_(in [PLDI](../PLDI/README.md#pldi))_ [Why is JavaScript not compiled to bytecode before sending over the network? - Software Engineering Stack Exchange](https://softwareengineering.stackexchange.com/questions/402250/why-is-javascript-not-compiled-to-bytecode-before-sending-over-the-network) ★
|
||||
|
||||
|
||||
### Repositories
|
||||
|
||||
_(in [Programming Languages](../Programming%20Languages/README.md#programming-languages))_ [xixixao/Shem: The compiler of the programming language Shem](https://github.com/xixixao/Shem) ★
|
||||
|
||||
_(in [Lua](../Lua/README.md#lua))_ [fengari-lua/fengari: 🌙 φεγγάρι - The Lua VM written in JS ES6 for Node and the browser](https://github.com/fengari-lua/fengari) ★
|
||||
|
||||
_(in [Lua](../Lua/README.md#lua))_ [fengari-lua/fengari-interop: Fengari \<=\> JS Interop](https://github.com/fengari-lua/fengari-interop) ★
|
||||
|
||||
_(in [Lua](../Lua/README.md#lua))_ [fengari-lua/fengari-web: Provides everything you need to run Fengari in the browser.](https://github.com/fengari-lua/fengari-web) ★
|
||||
|
||||
_(in [Programming Languages](../Programming%20Languages/README.md#programming-languages))_ [xixixao/Shem: The compiler of the programming language Shem](https://github.com/xixixao/Shem) ★
|
||||
|
||||
|
|
|
|||
|
|
@ -62,12 +62,12 @@ A Lambda Calculus with Naive Substitution (online @ [www.cambridge.org](https://
|
|||
|
||||
[On the Relation between the λμ-Calculus and the Syntactic Theory of Sequential Control](https://members.loria.fr/PdeGroote/papers/lpar94.pdf)
|
||||
|
||||
_(in [Partial Evaluation](../Partial%20Evaluation/README.md#partial-evaluation))_ [A partial evaluator for the untyped lambda-calculus](https://www.cambridge.org/core/journals/journal-of-functional-programming/article/partial-evaluator-for-the-untyped-lambdacalculus/EE324F936F0A009B6766B13FF6755DFC) 🏛️
|
||||
|
||||
_(in [Computational Complexity](../Computational%20Complexity/README.md#computational-complexity))_ The Typed Lambda Calculus is not Elementary Recursive (online @ [www.cs.cornell.edu](https://www.cs.cornell.edu/courses/cs6110/2012sp/Statman-typed-lambda-calculus.pdf)) ★
|
||||
|
||||
_(in [Name Binding](../Name%20Binding/README.md#name-binding))_ [Don’t Substitute Into Abstractions (Functional Pearl)](https://benl.ouroborus.net/papers/2016-dsim/lambda-dsim-20160328.pdf)
|
||||
|
||||
_(in [Partial Evaluation](../Partial%20Evaluation/README.md#partial-evaluation))_ [A partial evaluator for the untyped lambda-calculus](https://www.cambridge.org/core/journals/journal-of-functional-programming/article/partial-evaluator-for-the-untyped-lambdacalculus/EE324F936F0A009B6766B13FF6755DFC) 🏛️
|
||||
|
||||
|
||||
### Books
|
||||
|
||||
|
|
|
|||
|
|
@ -20,10 +20,10 @@ SPDX-License-Identifier: CC0-1.0
|
|||
|
||||
[dblp: LISP and Functional Programming 1990](https://dblp.org/db/conf/lfp/lfp1990.html) ★
|
||||
|
||||
_(in [Commodore 64](../Commodore%2064/README.md#commodore-64))_ [\"Micro-Lisp\" a lisp for the C64 - Google Groups](https://groups.google.com/forum/#!topic/comp.lang.lisp/6pPNzzpVV9o) ★
|
||||
|
||||
_(in [6502](../6502/README.md#6502))_ [COMFY-6502 compiler: port to Common Lisp](https://josephoswald.nfshost.com/comfy/summary.html) ★★
|
||||
|
||||
_(in [Commodore 64](../Commodore%2064/README.md#commodore-64))_ [\"Micro-Lisp\" a lisp for the C64 - Google Groups](https://groups.google.com/forum/#!topic/comp.lang.lisp/6pPNzzpVV9o) ★
|
||||
|
||||
|
||||
### Repositories
|
||||
|
||||
|
|
|
|||
|
|
@ -44,12 +44,12 @@ SPDX-License-Identifier: CC0-1.0
|
|||
|
||||
[What assumptions and methodology do metaproofs of logic theorems use and employ? - MathOverflow](http://mathoverflow.net/questions/8853/what-assumptions-and-methodology-do-metaproofs-of-logic-theorems-use-and-employ) ★
|
||||
|
||||
_(in [FoM](../FoM/README.md#fom))_ [getting rid of existential quantifiers - MathOverflow](http://mathoverflow.net/questions/90324/getting-rid-of-existential-quantifiers) ★
|
||||
|
||||
_(in [Mathematics](../Mathematics/README.md#mathematics))_ [Readings | Mathematics for Computer Science | Electrical Engineering and Computer Science | MIT OpenCourseWare](https://ocw.mit.edu/courses/6-042j-mathematics-for-computer-science-fall-2010/pages/readings/) ★★
|
||||
|
||||
_(in [Type Theory](../Type%20Theory/README.md#type-theory))_ [Type Theory and Mathematical Logic \| artagnon.com](https://artagnon.com/logic) ★
|
||||
|
||||
_(in [FoM](../FoM/README.md#fom))_ [getting rid of existential quantifiers - MathOverflow](http://mathoverflow.net/questions/90324/getting-rid-of-existential-quantifiers) ★
|
||||
|
||||
|
||||
### Papers
|
||||
|
||||
|
|
|
|||
|
|
@ -16,6 +16,8 @@ SPDX-License-Identifier: CC0-1.0
|
|||
|
||||
[combinatorics - Is the disjoint union of two Matroids a Matroid itself? - Mathematics Stack Exchange](https://math.stackexchange.com/questions/2504991/is-the-disjoint-union-of-two-matroids-a-matroid-itself) ★
|
||||
|
||||
[general topology - Topological matroids? - Mathematics Stack Exchange](https://math.stackexchange.com/questions/960007/topological-matroids) ★
|
||||
|
||||
|
||||
### Papers
|
||||
|
||||
|
|
|
|||
|
|
@ -12,3 +12,10 @@ SPDX-License-Identifier: CC0-1.0
|
|||
* url: https://math.stackexchange.com/questions/2504991/is-the-disjoint-union-of-two-matroids-a-matroid-itself
|
||||
|
||||
.
|
||||
|
||||
### general topology - Topological matroids? - Mathematics Stack Exchange
|
||||
|
||||
* url: https://math.stackexchange.com/questions/960007/topological-matroids
|
||||
* topics: Matroid Theory, Topology, Closure Systems
|
||||
|
||||
.
|
||||
|
|
|
|||
|
|
@ -13,6 +13,12 @@ exception: the ratings may be freely used for any purpose with no limitations.
|
|||
Matroid Theory
|
||||
--------------
|
||||
|
||||
### general topology - Topological matroids? - Mathematics Stack Exchange
|
||||
|
||||
* rating: 1
|
||||
|
||||
.
|
||||
|
||||
### Cryptomorphisms
|
||||
|
||||
* rating: 1
|
||||
|
|
|
|||
|
|
@ -40,7 +40,7 @@ _(in [x86](../x86/README.md#x86))_ [zwegner/x86-sat: Basic SAT model of x86 inst
|
|||
|
||||
[Direct Model-checking of SysML Models](https://www.scitepress.org/Papers/2021/102563/102563.pdf) ★
|
||||
|
||||
_(in [Software Engineering](../Software%20Engineering/README.md#software-engineering))_ Use of Formal Methods at Amazon Web Services (online @ [lamport.azurewebsites.net](https://lamport.azurewebsites.net/tla/formal-methods-amazon.pdf)) ★★★
|
||||
|
||||
_(in [Modal Logic](../Modal%20Logic/README.md#modal-logic))_ Modal Mu-Calculi (online @ [www.julianbradfield.org](https://www.julianbradfield.org/Research/MLH-bradstir.pdf))
|
||||
|
||||
_(in [Software Engineering](../Software%20Engineering/README.md#software-engineering))_ Use of Formal Methods at Amazon Web Services (online @ [lamport.azurewebsites.net](https://lamport.azurewebsites.net/tla/formal-methods-amazon.pdf)) ★★★
|
||||
|
||||
|
|
|
|||
|
|
@ -54,10 +54,10 @@ Definitional interpreters for higher-order programming languages (online @ [home
|
|||
|
||||
Trampolined style (online @ [dl.acm.org](https://dl.acm.org/doi/abs/10.1145/317636.317779)) ★★★
|
||||
|
||||
_(in [Theorem Proving](../Theorem%20Proving/README.md#theorem-proving))_ Theorem proving support in programming language semantics (online @ [arxiv.org](https://arxiv.org/abs/0707.0926)) ★
|
||||
|
||||
_(in [Name Binding](../Name%20Binding/README.md#name-binding))_ [A Metalanguage for Programming with Bound Names Modulo Renaming](https://www.cl.cam.ac.uk/~amp12/papers/metpbn/metpbn.pdf)
|
||||
|
||||
_(in [Theorem Proving](../Theorem%20Proving/README.md#theorem-proving))_ Theorem proving support in programming language semantics (online @ [arxiv.org](https://arxiv.org/abs/0707.0926)) ★
|
||||
|
||||
|
||||
### Books
|
||||
|
||||
|
|
|
|||
|
|
@ -30,10 +30,10 @@ SPDX-License-Identifier: CC0-1.0
|
|||
|
||||
[The Deep Insights of Alan Kay - mythz blog](https://mythz.servicestack.net/blog/2013/02/27/the-deep-insights-of-alan-kay/) ★★★
|
||||
|
||||
_(in [Probability Theory](../Probability%20Theory/README.md#probability-theory))_ [Is probability physical or idealistic? Is probability an inherent part of nature/reality?](https://philosophy.stackexchange.com/questions/113570/is-probability-physical-or-idealistic-is-probability-an-inherent-part-of-nature) ★
|
||||
|
||||
_(in [Computational Complexity](../Computational%20Complexity/README.md#computational-complexity))_ [Computability and Complexity (Stanford Encyclopedia of Philosophy)](https://plato.stanford.edu/entries/computability/) ★★★
|
||||
|
||||
_(in [Probability Theory](../Probability%20Theory/README.md#probability-theory))_ [Is probability physical or idealistic? Is probability an inherent part of nature/reality?](https://philosophy.stackexchange.com/questions/113570/is-probability-physical-or-idealistic-is-probability-an-inherent-part-of-nature) ★
|
||||
|
||||
|
||||
### Papers
|
||||
|
||||
|
|
|
|||
|
|
@ -46,10 +46,10 @@ SPDX-License-Identifier: CC0-1.0
|
|||
|
||||
[power - If we increased the frequency of HV-AC lines, could we get atmospheric air to excite and illuminate? - Electrical Engineering Stack Exchange](https://electronics.stackexchange.com/questions/694683/if-we-increased-the-frequency-of-hv-ac-lines-could-we-get-atmospheric-air-to-ex) ★
|
||||
|
||||
_(in [Probability Theory](../Probability%20Theory/README.md#probability-theory))_ [Is probability physical or idealistic? Is probability an inherent part of nature/reality?](https://philosophy.stackexchange.com/questions/113570/is-probability-physical-or-idealistic-is-probability-an-inherent-part-of-nature) ★
|
||||
|
||||
_(in [Group Theory](../Group%20Theory/README.md#group-theory))_ [Do all Noether theorems have a common mathematical structure?](https://physics.stackexchange.com/questions/597734/do-all-noether-theorems-have-a-common-mathematical-structure) ★
|
||||
|
||||
_(in [Probability Theory](../Probability%20Theory/README.md#probability-theory))_ [Is probability physical or idealistic? Is probability an inherent part of nature/reality?](https://philosophy.stackexchange.com/questions/113570/is-probability-physical-or-idealistic-is-probability-an-inherent-part-of-nature) ★
|
||||
|
||||
|
||||
### Papers
|
||||
|
||||
|
|
|
|||
|
|
@ -77,11 +77,7 @@ SPDX-License-Identifier: CC0-1.0
|
|||
|
||||
[pro465/rhokell: rho calculus + haskell thrown into the mixer](https://github.com/pro465/rhokell) ★
|
||||
|
||||
_(in [PLDI](../PLDI/README.md#pldi))_ [ibrahimsag/rw: an experiment in presenting code.](https://github.com/ibrahimsag/rw) ★★★
|
||||
|
||||
_(in [PLDI](../PLDI/README.md#pldi))_ [ebuswell/noneleatic: Noneleatic (Mutable State) Languages](https://github.com/ebuswell/noneleatic) ★
|
||||
|
||||
_(in [Genetic Programming](../Genetic%20Programming/README.md#genetic-programming))_ [Vaguery/Duck-language: A simple language for genetic programming](https://github.com/Vaguery/Duck-language) ★
|
||||
[Danskydan/Hilltop: Hilltop is a text-based, general-purpose programming language and model that borrows concepts from spreadsheet programming.](https://github.com/Danskydan/Hilltop) ★
|
||||
|
||||
_(in [Apple II](../Apple%20II/README.md#apple-ii))_ [bocchino/AppleCore: A core language for the Apple II](https://github.com/bocchino/AppleCore) ★
|
||||
|
||||
|
|
@ -91,6 +87,12 @@ _(in [Compiler Construction](../Compiler%20Construction/README.md#compiler-const
|
|||
|
||||
_(in [Coq](../Coq/README.md#coq))_ [codyroux/tinymatch: A teeny language with nats, lists and pattern matching, static and dynamic semantics and a proof of progress and preservation.](https://github.com/codyroux/tinymatch) ★
|
||||
|
||||
_(in [Genetic Programming](../Genetic%20Programming/README.md#genetic-programming))_ [Vaguery/Duck-language: A simple language for genetic programming](https://github.com/Vaguery/Duck-language) ★
|
||||
|
||||
_(in [PLDI](../PLDI/README.md#pldi))_ [ibrahimsag/rw: an experiment in presenting code.](https://github.com/ibrahimsag/rw) ★★★
|
||||
|
||||
_(in [PLDI](../PLDI/README.md#pldi))_ [ebuswell/noneleatic: Noneleatic (Mutable State) Languages](https://github.com/ebuswell/noneleatic) ★
|
||||
|
||||
|
||||
### Papers
|
||||
|
||||
|
|
|
|||
|
|
@ -116,3 +116,9 @@ SPDX-License-Identifier: CC0-1.0
|
|||
* url: https://github.com/pro465/rhokell
|
||||
|
||||
.
|
||||
|
||||
### Danskydan/Hilltop: Hilltop is a text-based, general-purpose programming language and model that borrows concepts from spreadsheet programming.
|
||||
|
||||
* url: https://github.com/Danskydan/Hilltop
|
||||
|
||||
.
|
||||
|
|
|
|||
|
|
@ -206,6 +206,12 @@ Barry Jay's (bond-eye) pattern language. Pattern calculus.
|
|||
|
||||
.
|
||||
|
||||
### Danskydan/Hilltop: Hilltop is a text-based, general-purpose programming language and model that borrows concepts from spreadsheet programming.
|
||||
|
||||
* rating: 1
|
||||
|
||||
.
|
||||
|
||||
### K \| Runtime Verification Inc
|
||||
|
||||
* rating: 1
|
||||
|
|
|
|||
|
|
@ -46,9 +46,9 @@ Programming in PROLOG (borrow @ [archive.org](https://archive.org/details/progra
|
|||
|
||||
The Art of Prolog (borrow @ [archive.org](https://archive.org/details/artofprologadvan0000ster)) ★★★
|
||||
|
||||
_(in [Artificial Intelligence](../Artificial%20Intelligence/README.md#artificial-intelligence))_ Prolog programming for artificial intelligence, 3rd ed. (borrow @ [archive.org](https://archive.org/details/prologprogrammin0000brat_l1m9)) ★
|
||||
|
||||
_(in [Formal Language](../Formal%20Language/README.md#formal-language))_ Natural Language Processing Techniques in Prolog (online @ [cs.union.edu](https://cs.union.edu/~striegnk/courses/nlp-with-prolog/html/index.html)) ★
|
||||
|
||||
_(in [Logic](../Logic/README.md#logic))_ Simply Logical (online @ [book.simply-logical.space](https://book.simply-logical.space/src/simply-logical.html), [github.com](https://github.com/simply-logical/simply-logical/releases/download/v1.0/SL.pdf)) ★
|
||||
|
||||
_(in [Artificial Intelligence](../Artificial%20Intelligence/README.md#artificial-intelligence))_ Prolog programming for artificial intelligence, 3rd ed. (borrow @ [archive.org](https://archive.org/details/prologprogrammin0000brat_l1m9)) ★
|
||||
|
||||
|
|
|
|||
|
|
@ -44,7 +44,7 @@ How to Design, Build, & Program Your Own Working Computer System (borrow @ [arch
|
|||
|
||||
Microprocessor Programming for Computer Hobbyists (borrow @ [archive.org](https://archive.org/details/microprocessorpr0000grah)) ★★★
|
||||
|
||||
_(in [PLDI](../PLDI/README.md#pldi))_ Threaded Interpretive Languages (online @ [archive.org](https://archive.org/details/R.G.LoeligerThreadedInterpretiveLanguagesTheirDesignAndImplementationByteBooks1981))
|
||||
|
||||
_(in [Forth](../Forth/README.md#forth))_ Forth on the Atari (online @ [archive.org](https://archive.org/details/ataribooks-forth-on-the-atari-learning-by-using)) ★
|
||||
|
||||
_(in [PLDI](../PLDI/README.md#pldi))_ Threaded Interpretive Languages (online @ [archive.org](https://archive.org/details/R.G.LoeligerThreadedInterpretiveLanguagesTheirDesignAndImplementationByteBooks1981))
|
||||
|
||||
|
|
|
|||
|
|
@ -38,14 +38,14 @@ SPDX-License-Identifier: CC0-1.0
|
|||
|
||||
[Use One Big Server - Speculative Branches](https://specbranch.com/posts/one-big-server/) ★
|
||||
|
||||
_(in [PLDI](../PLDI/README.md#pldi))_ [What blocks Ruby, Python to get Javascript V8 speed? - Stack Overflow](https://stackoverflow.com/questions/5168718/what-blocks-ruby-python-to-get-javascript-v8-speed) ★
|
||||
|
||||
_(in [PLDI](../PLDI/README.md#pldi))_ [Why is JavaScript not compiled to bytecode before sending over the network? - Software Engineering Stack Exchange](https://softwareengineering.stackexchange.com/questions/402250/why-is-javascript-not-compiled-to-bytecode-before-sending-over-the-network) ★
|
||||
|
||||
_(in [Game Development](../Game%20Development/README.md#game-development))_ [terminology - What exactly is a softlock? - Arqade](https://gaming.stackexchange.com/questions/357095/what-exactly-is-a-softlock) ★
|
||||
|
||||
_(in [Game Development](../Game%20Development/README.md#game-development))_ [exceptions - When to carry on with a buggy game state versus terminate the process? - Game Development Stack Exchange](https://gamedev.stackexchange.com/questions/186888/when-to-carry-on-with-a-buggy-game-state-versus-terminate-the-process) ★
|
||||
|
||||
_(in [PLDI](../PLDI/README.md#pldi))_ [What blocks Ruby, Python to get Javascript V8 speed? - Stack Overflow](https://stackoverflow.com/questions/5168718/what-blocks-ruby-python-to-get-javascript-v8-speed) ★
|
||||
|
||||
_(in [PLDI](../PLDI/README.md#pldi))_ [Why is JavaScript not compiled to bytecode before sending over the network? - Software Engineering Stack Exchange](https://softwareengineering.stackexchange.com/questions/402250/why-is-javascript-not-compiled-to-bytecode-before-sending-over-the-network) ★
|
||||
|
||||
|
||||
### Papers
|
||||
|
||||
|
|
@ -59,14 +59,14 @@ Computer Science Education: Where Are the Software Engineers of Tomorrow? (onlin
|
|||
|
||||
Use of Formal Methods at Amazon Web Services (online @ [lamport.azurewebsites.net](https://lamport.azurewebsites.net/tla/formal-methods-amazon.pdf)) ★★★
|
||||
|
||||
_(in [Model Checking](../Model%20Checking/README.md#model-checking))_ [Direct Model-checking of SysML Models](https://www.scitepress.org/Papers/2021/102563/102563.pdf) ★
|
||||
|
||||
_(in [Reactive Systems](../Reactive%20Systems/README.md#reactive-systems))_ Statecharts (online @ [www.inf.ed.ac.uk](https://www.inf.ed.ac.uk/teaching/courses/seoc/2005_2006/resources/statecharts.pdf)) ★★★
|
||||
|
||||
_(in [Reactive Systems](../Reactive%20Systems/README.md#reactive-systems))_ State Machines for Event-Driven Systems (online @ [barrgroup.com](https://barrgroup.com/embedded-systems/how-to/state-machines-event-driven-systems)) ★★★
|
||||
|
||||
_(in [Reactive Systems](../Reactive%20Systems/README.md#reactive-systems))_ Misunderstandings about state machines (online @ [www.stateworks.com](https://www.stateworks.com/active/download/wagf04-2-state-machine-misunderstandings.pdf)) ★★★
|
||||
|
||||
_(in [Model Checking](../Model%20Checking/README.md#model-checking))_ [Direct Model-checking of SysML Models](https://www.scitepress.org/Papers/2021/102563/102563.pdf) ★
|
||||
|
||||
|
||||
### Books
|
||||
|
||||
|
|
|
|||
|
|
@ -30,14 +30,14 @@ SPDX-License-Identifier: CC0-1.0
|
|||
|
||||
[The Limits of Reason (Gregory Chaitin)](https://web.archive.org/web/20140812152541/https://www.cs.auckland.ac.nz/~chaitin/sciamer3.html) ★
|
||||
|
||||
_(in [Computational Complexity](../Computational%20Complexity/README.md#computational-complexity))_ [Computability and Complexity (Stanford Encyclopedia of Philosophy)](https://plato.stanford.edu/entries/computability/) ★★★
|
||||
|
||||
_(in [Computational Complexity](../Computational%20Complexity/README.md#computational-complexity))_ [Theory of Computing: An Open Access Electronic Journal in Theoretical Computer Science](http://theoryofcomputing.org/) ★
|
||||
|
||||
_(in [Automata Theory](../Automata%20Theory/README.md#automata-theory))_ [Turing Machines (William Shoaf, 2001, pdf)](https://web.archive.org/web/20120514172528/http://www.cs.fit.edu/~wds/classes/complexity/lct/turing.pdf) ★
|
||||
|
||||
_(in [Automata Theory](../Automata%20Theory/README.md#automata-theory))_ [Csc520 Foundations of Computer Science](https://web.archive.org/web/20161105235418/https://www.cs.wcupa.edu/rkline/csc520) ★
|
||||
|
||||
_(in [Computational Complexity](../Computational%20Complexity/README.md#computational-complexity))_ [Computability and Complexity (Stanford Encyclopedia of Philosophy)](https://plato.stanford.edu/entries/computability/) ★★★
|
||||
|
||||
_(in [Computational Complexity](../Computational%20Complexity/README.md#computational-complexity))_ [Theory of Computing: An Open Access Electronic Journal in Theoretical Computer Science](http://theoryofcomputing.org/) ★
|
||||
|
||||
|
||||
### Books
|
||||
|
||||
|
|
|
|||
|
|
@ -16,7 +16,7 @@ SPDX-License-Identifier: CC0-1.0
|
|||
|
||||
[Comparison of topologies - Wikipedia, the free encyclopedia](https://en.wikipedia.org/wiki/Comparison_of_topologies#Lattice_of_topologies)
|
||||
|
||||
[general topology - Topological matroids? - Mathematics Stack Exchange](https://math.stackexchange.com/questions/960007/topological-matroids) ★
|
||||
_(in [Matroid Theory](../Matroid%20Theory/README.md#matroid-theory))_ [general topology - Topological matroids? - Mathematics Stack Exchange](https://math.stackexchange.com/questions/960007/topological-matroids) ★
|
||||
|
||||
|
||||
### Papers
|
||||
|
|
|
|||
|
|
@ -12,11 +12,3 @@ SPDX-License-Identifier: CC0-1.0
|
|||
* url: https://en.wikipedia.org/wiki/Comparison_of_topologies#Lattice_of_topologies
|
||||
|
||||
.
|
||||
|
||||
### general topology - Topological matroids? - Mathematics Stack Exchange
|
||||
|
||||
* url: https://math.stackexchange.com/questions/960007/topological-matroids
|
||||
* topics: Topology, Closure Systems
|
||||
* future-topics: Matroid Theory
|
||||
|
||||
.
|
||||
|
|
|
|||
|
|
@ -88,9 +88,3 @@ Alexandroff spaces are not necessarily finite, but they are "finitely based".
|
|||
Products and quotients of Alexandroff spaces are Alexandroff spaces.
|
||||
|
||||
I don't know how interesting Alexandroff spaces are.
|
||||
|
||||
### general topology - Topological matroids? - Mathematics Stack Exchange
|
||||
|
||||
* rating: 1
|
||||
|
||||
.
|
||||
|
|
|
|||
|
|
@ -49,13 +49,13 @@ Observational Equality, Now! (online @ [strictlypositive.org](http://strictlypos
|
|||
|
||||
_(in [Calculus of Constructions](../Calculus%20of%20Constructions/README.md#calculus-of-constructions))_ [The Calculus of Inductive Constructions](https://www.cs.uoregon.edu/research/summerschool/summer11/lectures/oplss-herbelin1.pdf) ★
|
||||
|
||||
_(in [Type Systems](../Type%20Systems/README.md#type-systems))_ Abstract Types have Existential Type (online @ [homepages.inf.ed.ac.uk](https://homepages.inf.ed.ac.uk/gdp/publications/Abstract_existential.pdf)) 🏛️
|
||||
|
||||
_(in [Computational Complexity](../Computational%20Complexity/README.md#computational-complexity))_ The Typed Lambda Calculus is not Elementary Recursive (online @ [www.cs.cornell.edu](https://www.cs.cornell.edu/courses/cs6110/2012sp/Statman-typed-lambda-calculus.pdf)) ★
|
||||
|
||||
_(in [Name Binding](../Name%20Binding/README.md#name-binding))_ [A Type and Scope Safe Universe of Syntaxes with Binding](https://pure.strath.ac.uk/ws/portalfiles/portal/114903157/Allais_etal_ICFP2018_A_type_and_scope_safe_universe_of_syntaxes_with_binding.pdf)
|
||||
|
||||
_(in [Term Rewriting](../Term%20Rewriting/README.md#term-rewriting))_ [The Rho Cube](https://link.springer.com/content/pdf/10.1007/3-540-45315-6_11.pdf)
|
||||
|
||||
_(in [Name Binding](../Name%20Binding/README.md#name-binding))_ [A Type and Scope Safe Universe of Syntaxes with Binding](https://pure.strath.ac.uk/ws/portalfiles/portal/114903157/Allais_etal_ICFP2018_A_type_and_scope_safe_universe_of_syntaxes_with_binding.pdf)
|
||||
_(in [Type Systems](../Type%20Systems/README.md#type-systems))_ Abstract Types have Existential Type (online @ [homepages.inf.ed.ac.uk](https://homepages.inf.ed.ac.uk/gdp/publications/Abstract_existential.pdf)) 🏛️
|
||||
|
||||
|
||||
### Books
|
||||
|
|
|
|||
|
|
@ -34,10 +34,10 @@ Unification: A Multidisciplinary Survey (online @ [kevincrawfordknight.github.io
|
|||
|
||||
Correcting a Widespread Error in Unification Algorithms (online @ [norvig.com](https://norvig.com/unify-bug.pdf)) ★
|
||||
|
||||
_(in [Formal Language](../Formal%20Language/README.md#formal-language))_ [Functional Unification Grammar](https://aclanthology.org/P84-1018.pdf)
|
||||
|
||||
_(in [Equational Logic](../Equational%20Logic/README.md#equational-logic))_ [Equational logic, unification and term rewriting](https://www2.math.uu.se/~palmgren/tillog/equlogic07.pdf) ★★
|
||||
|
||||
_(in [Formal Language](../Formal%20Language/README.md#formal-language))_ [Functional Unification Grammar](https://aclanthology.org/P84-1018.pdf)
|
||||
|
||||
|
||||
### Books
|
||||
|
||||
|
|
|
|||
11
script/build_readmes/README.md
Normal file
11
script/build_readmes/README.md
Normal file
|
|
@ -0,0 +1,11 @@
|
|||
We have a collection of resources, formatted as Feedmark files (Markdown files with extra structure).
|
||||
|
||||
This Python program reads in all these files, collates them, and writes out combined files (READMEs).
|
||||
|
||||
Each entry has 1 or more topics. Each entry is in a file in a directory, and this establishes its
|
||||
"main topic". But the entry can also have a "topics:" key. If it does, this indicates it is in 2
|
||||
or more topics.
|
||||
|
||||
The READMEs are rendered on a topic-by-topic basis. However, if an entry has more than one topic,
|
||||
it is included on each topic README that it has a topic for. In the topic READMEs which are not its
|
||||
"main" topic, it shows the "main" topic of the entry, as a link.
|
||||
|
|
@ -56,7 +56,7 @@ def write_readme_file(base_dir, topic, topic_section, entries, secondary_entries
|
|||
for i, webpage in enumerate(webpages):
|
||||
f.write(format_entry(webpage, format_webpage))
|
||||
|
||||
for source_topic, entries in sec_webpages.items():
|
||||
for source_topic, entries in sorted(sec_webpages.items()):
|
||||
for entry in entries:
|
||||
f.write(format_entry(entry, format_webpage, source_topic=source_topic))
|
||||
|
||||
|
|
@ -65,7 +65,7 @@ def write_readme_file(base_dir, topic, topic_section, entries, secondary_entries
|
|||
for i, repo in enumerate(repos):
|
||||
f.write(format_entry(repo, format_repo))
|
||||
|
||||
for source_topic, entries in sec_repos.items():
|
||||
for source_topic, entries in sorted(sec_repos.items()):
|
||||
for entry in entries:
|
||||
f.write(format_entry(entry, format_repo, source_topic=source_topic))
|
||||
|
||||
|
|
@ -74,7 +74,7 @@ def write_readme_file(base_dir, topic, topic_section, entries, secondary_entries
|
|||
for i, paper in enumerate(papers):
|
||||
f.write(format_entry(paper, format_paper))
|
||||
|
||||
for source_topic, entries in sec_papers.items():
|
||||
for source_topic, entries in sorted(sec_papers.items()):
|
||||
for entry in entries:
|
||||
f.write(format_entry(entry, format_paper, source_topic=source_topic))
|
||||
|
||||
|
|
@ -83,7 +83,7 @@ def write_readme_file(base_dir, topic, topic_section, entries, secondary_entries
|
|||
for i, book in enumerate(books):
|
||||
f.write(format_entry(book, format_book))
|
||||
|
||||
for source_topic, entries in sec_books.items():
|
||||
for source_topic, entries in sorted(sec_books.items()):
|
||||
for entry in entries:
|
||||
f.write(format_entry(entry, format_book, source_topic=source_topic))
|
||||
|
||||
|
|
|
|||
Loading…
Add table
Reference in a new issue