Notes
- blogroll
- slashes
- notes
- A Call-by-Need Lambda Calculus
- A Correspondence Between ALGOL 60 and Church's Lambda-Notation
- A Correspondence Between ALGOL 60 and Church’s Lambda-Notation: Part I
- A Correspondence Between ALGOL 60 and Church’s Lambda-Notation: Part II
- An Adequate Operational Semantics of Sharing in Lazy Evaluation
- An Axiomatic Basis for Computer Programming
- audio compression
- baco
- call-by-name
- classical logic
- code
- comonad
- compression
- computational comonad
- Computational Comonads and Intensional Semantics
- demand semantics
- denotational semantics
- Dijkstra monad
- Dijkstra Monads for All
- disjunction and existence properties
- Evaluation strategies for monadic computations
- extension and intension
- functions in demand semantics
- Guarded Commands, Nondeterminacy and Formal Derivation of Programs
- Haskell
- higher-order abstract syntax
- Hoare logic
- interactive input-output monad
- intuitionistic logic
- isorecursive types
- join a Zulip
- Krivine machine
- LCF Considered as a Programming Language
- linear logic
- LJ
- LK
- logic of computable functions
- Many Logics
- minimal logic
- natural transformation
- paraconsistent logic
- parametric higher-order abstract syntax
- parametricity
- PCF
- prefix code
- program logic
- reading list
- recursion in demand semantics
- semantics monad
- sequent calculus
- start
- TA a class
- tags
- weakest precondition