Pages that link to "Item:Q1280731"
From MaRDI portal
The following pages link to Revised report on the algorithmic language scheme (Q1280731):
Displaying 18 items.
- Deriving a Floyd-Hoare logic for non-local jumps from a formulæ-as-types notion of control (Q444460) (← links)
- BIT: A very compact Scheme system for microcontrollers (Q812083) (← links)
- Fixing \texttt{letrec}: A faithful yet efficient implementation of Scheme's recursive binding construct (Q812087) (← links)
- Implementing metcast in Scheme (Q812091) (← links)
- Compilation of extended recursion in call-by-value functional languages (Q848739) (← links)
- Combining algebraic effects with continuations (Q879352) (← links)
- Types as graphs: Continuations in type logical grammar (Q1006443) (← links)
- The carneades model of argument and burden of proof (Q1028962) (← links)
- A construction of one-point bases in extended lambda calculi (Q1029098) (← links)
- Report on the Larch shared language (Q1067767) (← links)
- Encoding types in ML-like languages (Q1826630) (← links)
- On the call-by-value CPS transform and its semantics (Q1887170) (← links)
- A static simulation of dynamic delimited control (Q2464731) (← links)
- Defining actions in concurrent declarative programming (Q2841291) (← links)
- A Complete, Co-inductive Syntactic Theory of Sequential Control and State (Q3184753) (← links)
- The Recursive Union of Some Gradual Types (Q3188297) (← links)
- Revised6 Report on the Algorithmic Language Scheme (Q3401233) (← links)
- Component support in PLT scheme (Q4791021) (← links)
