Pages that link to "Item:Q4193435"
From MaRDI portal
The following pages link to Approximate Reduction and Lambda Calculus Models (Q4193435):
Displayed 10 items.
- Expressive power of typed and type-free programming languages (Q761790) (← links)
- Full abstraction and limiting completeness in equational languages (Q1121676) (← links)
- An approximation theorem for topological lambda models and the topological incompleteness of lambda calculus (Q1198661) (← links)
- An algebraic interpretation of the \(\lambda\beta K\)-calculus; and an application of a labelled \(\lambda\)-calculus (Q1229201) (← links)
- Computing in unpredictable environments: semantics, reduction strategies, and program transformations (Q1389440) (← links)
- From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models (Q1583485) (← links)
- Approximation properties of abstract data types (Q1838281) (← links)
- Relating graph and term rewriting via Böhm models (Q1924551) (← links)
- The interpretation of unsolvable <i>λ</i>-terms in models of untyped <i>λ</i>-calculus (Q4254697) (← links)
- On the construction of stable models of untyped \(\lambda\)-calculus (Q5958611) (← links)