Revised report on the algorithmic language scheme
From MaRDI portal
Publication:1280731
DOI10.1023/A:1010051815785zbMath0965.68008OpenAlexW1783388813MaRDI QIDQ1280731
Publication date: 18 May 1999
Published in: Higher-Order and Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1010051815785
Related Items
On the call-by-value CPS transform and its semantics, Compilation of extended recursion in call-by-value functional languages, A Complete, Co-inductive Syntactic Theory of Sequential Control and State, The Recursive Union of Some Gradual Types, Combining algebraic effects with continuations, Deriving a Floyd-Hoare logic for non-local jumps from a formulæ-as-types notion of control, Unnamed Item, A static simulation of dynamic delimited control, Types as graphs: Continuations in type logical grammar, The carneades model of argument and burden of proof, A construction of one-point bases in extended lambda calculi, Revised6 Report on the Algorithmic Language Scheme, Encoding types in ML-like languages, Defining Actions in Concurrent Declarative Programming
Uses Software
