Pages that link to "Item:Q3724297"
From MaRDI portal
The following pages link to Logical relations and the typed λ-calculus (Q3724297):
Displayed 25 items.
- A characterization of lambda definability in categorical models of implicit polymorphism (Q673121) (← links)
- Proving properties of typed \(\lambda\)-terms using realizability, covers, and sheaves (Q673628) (← links)
- Kripke-style models for typed lambda calculus (Q804559) (← links)
- A verified framework for higher-order uncurrying optimizations (Q968367) (← links)
- A provably correct translation of the \(\lambda \)-calculus into a mathematical model of C++ (Q1015388) (← links)
- An intersection problem for finite automata (Q1118410) (← links)
- Polymorphic rewriting conserves algebraic strong normalization (Q1176244) (← links)
- An algebraic generalization of Frege structures -- binding algebras (Q1274449) (← links)
- Unary PCF is decidable (Q1274980) (← links)
- The behavior-realization adjunction and generalized homomorphic relations (Q1391868) (← links)
- Behavioural inverse limit \(\lambda\)-models (Q1434350) (← links)
- Safe recursion with higher types and BCK-algebra (Q1577481) (← links)
- Relational interpretations of recursive types in an operational setting. (Q1854316) (← links)
- Prelogical relations (Q1854557) (← links)
- Specification and verification of object-oriented programs using supertype abstraction (Q1902305) (← links)
- Linear Läuchli semantics (Q1919529) (← links)
- Some intuitions behind realizability semantics for constructive logic: Tableaux and Läuchli countermodels (Q1923579) (← links)
- Selective strictness and parametricity in structural operational semantics, inequationally (Q2464947) (← links)
- Reducibility (Q2842839) (← links)
- Syntactic Logical Relations for Polymorphic and Recursive Types (Q2864153) (← links)
- Logical relations for monadic types (Q3545276) (← links)
- Fully abstract translations between functional languages (Q4286526) (← links)
- An Application of Category-Theoretic Semantics to the Characterisation of Complexity Classes Using Higher-Order Function Algebras (Q4382502) (← links)
- Constructive set theoretic models of typed combinatory logic (Q5287682) (← links)
- Finitary PCF is not decidable (Q5958762) (← links)