Lambda galore
From MaRDI portal
Cites work
- A faithful and quantitative notion of distant reduction for the lambda-calculus with generalized applications
- A filter lambda model and the completeness of type assignment
- A formulation of the simple theory of types.
- A lambda calculus satellite
- A theory of type polymorphism in programming
- An approximation theorem for topological lambda models and the topological incompleteness of lambda calculus
- An extension of basic functionality theory for -calculus
- An irregular filter model
- Call-by-name, call-by-value and the \(\lambda\)-calculus
- Call-By-Value, Again!
- Compositional characterisations of \(\lambda\)-terms using intersection types
- Correspondence between ALGOL 60 and Church's Lambda-notation
- Domain theory in logical form
- Essential and relational models
- Filter models with polymorphic types
- Full abstraction in the lazy lambda calculus
- Functionality in combinatory logic.
- scientific article; zbMATH DE number 5852776 (Why is no real title available?)
- scientific article; zbMATH DE number 3889502 (Why is no real title available?)
- scientific article; zbMATH DE number 3817067 (Why is no real title available?)
- scientific article; zbMATH DE number 3961577 (Why is no real title available?)
- scientific article; zbMATH DE number 3780545 (Why is no real title available?)
- scientific article; zbMATH DE number 46869 (Why is no real title available?)
- scientific article; zbMATH DE number 3523519 (Why is no real title available?)
- scientific article; zbMATH DE number 3349775 (Why is no real title available?)
- scientific article; zbMATH DE number 3379785 (Why is no real title available?)
- scientific article; zbMATH DE number 3383521 (Why is no real title available?)
- scientific article; zbMATH DE number 3423547 (Why is no real title available?)
- Title not available (Why is no real title available?)
- Title not available (Why is no real title available?)
- Inductive types and type constraints in the second-order lambda calculus
- Intensional interpretations of functionals of finite type I
- Intersection and union types: Syntax and semantics
- Intersection types and lambda models
- Lambda‐Calculus Models and Extensionality
- New semantical insights into call-by-value \(\lambda\)-calculus
- Non-idempotent intersection types for the lambda-calculus
- On Proving Limiting Completeness
- Semantical analysis of perpetual strategies in -calculus
- Session types
- Strong normalization from an unusual point of view
- The calculus of constructions
- The fixed point property and a technique to harness double fixed point combinators
- Towards logical foundations for probabilistic computation
- Type theories, normal forms, and \(D_{\infty}\)-lambda-models
This page was built for publication: Lambda galore
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7317486)
