Decomposing typed lambda calculus into a couple of categorical programming languages
From MaRDI portal
(Redirected from Publication:5057475)
Recommendations
Cites work
- A syntactic theory of sequential control
- Explicit substitutions
- Fibrations with indeterminates: contextual and functional completeness for polymorphic lambda calculi
- Functional completeness of cartesian categories
- scientific article; zbMATH DE number 426302 (Why is no real title available?)
- scientific article; zbMATH DE number 431764 (Why is no real title available?)
- scientific article; zbMATH DE number 3959364 (Why is no real title available?)
- scientific article; zbMATH DE number 810100 (Why is no real title available?)
- Sound and complete axiomatisations of call-by-value control operators
- The categorical abstract machine
- The linear abstract machine
Cited in
(10)- Modelling environments in call-by-value programming languages.
- Reversible effects as inverse arrows
- Correct Looping Arrows from Cyclic Terms
- scientific article; zbMATH DE number 2185674 (Why is no real title available?)
- Categorical semantics for higher order polymorphic lambda calculus
- The functional machine calculus
- Comparing Hagino's categorical programming language and typed lambda- calculi
- The relational machine calculus
- The functional machine calculus. III: Control
- Translating lambda calculus into C++ templates
This page was built for publication: Decomposing typed lambda calculus into a couple of categorical programming languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5057475)