Pages that link to "Item:Q1295368"
From MaRDI portal
The following pages link to Typing untyped \(\lambda\)-terms, or reducibility strikes again! (Q1295368):
Displaying 11 items.
- A decidable theory of type assignment (Q365669) (← links)
- Behavioural inverse limit \(\lambda\)-models (Q1434350) (← links)
- The completeness of BCD for an operational semantics (Q1709713) (← links)
- De Bruijn's syntax and reductional behaviour of \(\lambda\)-terms: The typed case (Q1763159) (← links)
- De Bruijn's syntax and reductional behaviour of \(\lambda\)-terms: the untyped case (Q1764799) (← links)
- Typing and computational properties of lambda expressions (Q1819575) (← links)
- Normalization without reducibility (Q1840460) (← links)
- Intersection types for explicit substitutions (Q1887145) (← links)
- Reducibility: a ubiquitous method in lambda calculus with intersection types (Q2842839) (← links)
- A New Type Assignment for Strongly Normalizable Terms (Q2958549) (← links)
- Intersection Types for the Resource Control Lambda Calculi (Q3105748) (← links)