Pages that link to "Item:Q1583485"
From MaRDI portal
The following pages link to From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models (Q1583485):
Displaying 9 items.
- Relational graph models, Taylor expansion and extensionality (Q283769) (← links)
- Graph easy sets of mute lambda terms (Q288793) (← links)
- A relational semantics for parallelism and non-determinism in a functional setting (Q408545) (← links)
- A synthetic axiomatization of map theory (Q906269) (← links)
- An irregular filter model (Q930872) (← links)
- Building continuous webbed models for system F (Q1826624) (← links)
- Easiness in graph models (Q2368937) (← links)
- Compositional characterisations of \(\lambda\)-terms using intersection types (Q2566033) (← links)
- Easy lambda-terms are not always simple (Q2889181) (← links)
