Pages that link to "Item:Q1819575"
From MaRDI portal
The following pages link to Typing and computational properties of lambda expressions (Q1819575):
Displaying 16 items.
- Preface to the special volume (Q534064) (← links)
- Intersection type assignment systems with higher-order algebraic rewriting (Q672048) (← links)
- Translating lambda calculus into C++ templates (Q832102) (← links)
- A semantic characterization of the well-typed formulae of \(\lambda\)- calculus (Q1208735) (← links)
- Behavioural inverse limit \(\lambda\)-models (Q1434350) (← links)
- Normalization without reducibility (Q1840460) (← links)
- Intersection types for explicit substitutions (Q1887145) (← links)
- Compositional characterisations of \(\lambda\)-terms using intersection types (Q2566033) (← links)
- AN EXTENSION OF AN AUTOMATED TERMINATION METHOD OF RECURSIVE FUNCTIONS (Q3021959) (← links)
- (Q3194765) (← links)
- Approximation and normalization results for typeable term rewriting systems (Q4645802) (← links)
- On automating the extraction of programs from proofs using product types (Q4916212) (← links)
- Singleton, union and intersection types for program extraction (Q5096245) (← links)
- Completeness of type assignment systems with intersection, union, and type quantifiers (Q5958301) (← links)
- Machine Deduction (Q6083700) (← links)
- Characterization of the principal type of normal forms in an intersection type system (Q6567783) (← links)
