The functional machine calculus. III: Control
From MaRDI portal
Cites work
- A calculus of mobile processes. I
- A call-by-name lambda-calculus machine
- A compositional natural semantics and Hoare logic for low-level languages
- A confluent λ-calculus with a catch/throw mechanism
- A functional theory of exceptions
- A type system for call-by-name exceptions
- Call-by-name, call-by-value and the \(\lambda\)-calculus
- Classical logic, continuation semantics and abstract machines
- Data types à la carte
- Decomposing typed lambda calculus into a couple of categorical programming languages
- Exceptional syntax
- Fusion for free. Efficient algebraic effect handlers
- Handlers in action
- Handling algebraic effects
- scientific article; zbMATH DE number 2185662 (Why is no real title available?)
- scientific article; zbMATH DE number 3827823 (Why is no real title available?)
- scientific article; zbMATH DE number 3907744 (Why is no real title available?)
- scientific article; zbMATH DE number 3730111 (Why is no real title available?)
- scientific article; zbMATH DE number 1222571 (Why is no real title available?)
- scientific article; zbMATH DE number 1324438 (Why is no real title available?)
- scientific article; zbMATH DE number 2087441 (Why is no real title available?)
- scientific article; zbMATH DE number 2087542 (Why is no real title available?)
- scientific article; zbMATH DE number 2120508 (Why is no real title available?)
- scientific article; zbMATH DE number 1405668 (Why is no real title available?)
- scientific article; zbMATH DE number 7559490 (Why is no real title available?)
- scientific article; zbMATH DE number 233974 (Why is no real title available?)
- Intensional interpretations of functionals of finite type I
- Intersection types and computational effects
- Introducing \(\llparenthesis\lambda\rrparenthesis\), a \(\lambda \)-calculus for effectful computation
- Monads and adjunctions for global exceptions
- Notions of computation and monads
- Parallel reductions in \(\lambda\)-calculus
- Perpetual reductions in -calculus
- Polynomial interpretations for higher-order rewriting
- Quantitative types for the functional machine calculus
- Shallow effect handlers
- Simple types for probabilistic termination
- Strong normalizability of the non-deterministic catch/throw calculi
- Substitution, jumps, and algebraic effects
- The functional machine calculus
- The functional machine calculus II: semantics
- The Mechanical Evaluation of Expressions
- The next 700 programming languages
- The relational machine calculus
- The stack calculus
- Untersuchungen über das logische Schliessen. II
This page was built for publication: The functional machine calculus. III: Control
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7312200)