scientific article; zbMATH DE number 431764
From MaRDI portal
Publication:3138540
Recommendations
- scientific article; zbMATH DE number 1342246
- scientific article; zbMATH DE number 1499090
- scientific article; zbMATH DE number 2044492
- scientific article; zbMATH DE number 2185664
- Inhabitation of types in the simply typed lambda calculus
- Untyped lambda-calculus with input-output
- A unified approach to type theory through a refined -calculus
- The simply typed rewriting calculus
- Some lambda calculus and type theory formalized
- scientific article; zbMATH DE number 6496907
Cited in
(16)- scientific article; zbMATH DE number 6496907 (Why is no real title available?)
- Categorical abstract machines for higher-order typed -calculi
- Adding algebraic rewriting to the untyped lambda calculus
- Theoretical Pearls:Representing ‘undefined’ in lambda calculus
- Simply-typed underdeterminism
- A partial evaluator for the untyped lambda-calculus
- Some lambda calculus and type theory formalized
- General recursive functions in a very simply interpretable typed -calculus
- Clones, closed categories, and combinatory logic
- scientific article; zbMATH DE number 2185664 (Why is no real title available?)
- Pruning simply typed -terms
- A category theoretic formulation for Engeler-style models of the untyped -calculus
- Inhabitation in simply typed lambda-calculus through a lambda-calculus for proof search
- Categories with families: unityped, simply typed, and dependently typed
- Decomposing typed lambda calculus into a couple of categorical programming languages
- Towards a proof theory of rewriting: The simply typed \(2\lambda\)-calculus
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3138540)
