From Algol to polymorphic linear lambda-calculus
From MaRDI portal
Recommendations
Cited in
(15)- Automata-theoretic semantics of idealized Algol with passive expressions
- Monoidal indeterminates and categories of possible worlds
- Operational properties of \texttt{Lily}, a polymorphic linear lambda calculus with recursion
- A fibrational framework for possible-world semantics of \textsc{Algol}-like languages
- Polymorphic lambda calculus and subtyping.
- Monoidal indeterminates and categories of possible worlds
- Objects and classes in Algol-like languages
- A nominal relational model for local store
- Safe session-based concurrency with shared linear state
- The essence of parallel Algol.
- Deriving a Floyd-Hoare logic for non-local jumps from a formulæ-as-types notion of control
- Note on Algol and conservatively extending functional programming
- Enriching an Effect Calculus with Linear Types
- The regular-language semantics of second-order idealized ALGOL
- Q\# as a quantum algorithmic language
This page was built for publication: From Algol to polymorphic linear lambda-calculus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5487826)