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