scientific article; zbMATH DE number 431764
From MaRDI portal
Publication:3138540
zbMATH Open0792.03007MaRDI QIDQ3138540FDOQ3138540
Authors: Bart Jacobs
Publication date: 11 November 1993
Title of this publication is not available (Why is that?)
Recommendations
- scientific article; zbMATH DE number 1342246
- scientific article; zbMATH DE number 1499090
- scientific article; zbMATH DE number 2044492
- scientific article
- Inhabitation of types in the simply typed lambda calculus
- Untyped lambda-calculus with input-output
- A unified approach to type theory through a refined \(\lambda\)-calculus
- The simply typed rewriting calculus
- Some lambda calculus and type theory formalized
- scientific article; zbMATH DE number 6496907
Cited In (14)
- Title not available (Why is that?)
- Categorical abstract machines for higher-order typed \(\lambda\)-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 \(\lambda\)-calculus
- Clones, closed categories, and combinatory logic
- Title not available (Why is that?)
- Pruning simply typed -terms
- Inhabitation in simply typed lambda-calculus through a lambda-calculus for proof search
- 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)