scientific article; zbMATH DE number 3556025
From MaRDI portal
Publication:4128535
Cited in
(13)- Kripke-style models for typed lambda calculus
- Collapsing partial combinatory algebras
- On polymorphic types of untyped terms
- Graph easy sets of mute lambda terms
- Forcing in stable models of untyped -calculus
- Infinite \(\lambda\)-calculus and types
- From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models
- Some new results on easy lambda-terms
- Finite generation and presentation problems for lambda calculus and combinatory logic
- Easiness in graph models
- Simple easy terms
- Easy lambda-terms are not always simple
- On the Jacopini technique
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 Q4128535)
