Pages that link to "Item:Q801050"
From MaRDI portal
The following pages link to The lambda calculus. Its syntax and semantics. Rev. ed. (Q801050):
Displaying 50 items.
- Head linear reduction and pure proof net extraction (Q1342250) (← links)
- Algebraic domains of natural transformations (Q1349657) (← links)
- Combining algebraic rewriting, extensional lambda calculi, and fixpoints (Q1349901) (← links)
- A meta-language for typed object-oriented languages (Q1350339) (← links)
- Intersection type assignment systems (Q1350344) (← links)
- On reduction-based process semantics (Q1350347) (← links)
- Normalization results for typeable rewrite systems (Q1357006) (← links)
- Strong normalization from weak normalization in typed \(\lambda\)-calculi (Q1357009) (← links)
- Non-existent Statman's double fixed point combinator does not exist, indeed (Q1368379) (← links)
- On the Jacopini technique (Q1376416) (← links)
- A conjecture on numeral systems (Q1381438) (← links)
- A semantical storage operator theorem for all types (Q1382182) (← links)
- Lambda calculus with explicit recursion (Q1383145) (← links)
- The simply typed theory of \(\beta\)-conversion has no maximum extension (Q1383152) (← links)
- A syntactical proof of the operational equivalence of two \(\lambda\)-terms (Q1390880) (← links)
- Infinitary lambda calculus (Q1392145) (← links)
- Unifying overloading and \(\lambda\)-abstraction: \(\lambda^{\{\,\}}\) (Q1392284) (← links)
- Revisiting the notion of function (Q1394989) (← links)
- On the strong normalisation of intuitionistic natural deduction with permutation-conversions (Q1400711) (← links)
- The subtyping problem for second-order types is undecidable. (Q1400717) (← links)
- A formalised first-order confluence proof for the \(\lambda\)-calculus using one-sorted variable names. (Q1401936) (← links)
- A binary modal logic for the intersection types of lambda-calculus. (Q1427854) (← links)
- The semantics of entailment omega (Q1430899) (← links)
- Intersection types and domain operators (Q1434348) (← links)
- Behavioural inverse limit \(\lambda\)-models (Q1434350) (← links)
- On the relationship between compact regularity and Gentzen's cut rule (Q1434354) (← links)
- Uncomputability: The problem of induction internalized (Q1434378) (← links)
- Generalized filter models (Q1575259) (← links)
- Proof-search in type-theoretic languages: An introduction (Q1575935) (← links)
- Lambda-dropping: Transforming recursive equations into programs with block structure (Q1583366) (← links)
- From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models (Q1583485) (← links)
- On infinite \(\eta\)-expansion (Q1598516) (← links)
- A coinductive completeness proof for the equivalence of recursive types (Q1607224) (← links)
- Relating conflict-free stable transition and event models via redex families (Q1608893) (← links)
- Comparing logics for rewriting: Rewriting logic, action calculi and tile logic (Q1608920) (← links)
- Consistency argument and classification problem in \(\lambda\)-calculus (Q1610037) (← links)
- A computable expression of closure to efficient causation (Q1617623) (← links)
- The Church-Rosser theorem and quantitative analysis of witnesses (Q1627965) (← links)
- Denotational semantics of membrane systems by using complete metric spaces (Q1682859) (← links)
- Fixed points in lambda calculus. an eccentric survey of problems and solutions (Q1688969) (← links)
- Intensional computation with higher-order functions (Q1733061) (← links)
- Programs as data structures in \(\lambda\)SF-calculus (Q1744389) (← links)
- Strong normalization through intersection types and memory (Q1744407) (← links)
- A formalisation of nominal \(\alpha\)-equivalence with A and AC function symbols (Q1744440) (← links)
- Projections for infinitary rewriting (Q1744449) (← links)
- On the number of unary-binary tree-like structures with restrictions on the unary height (Q1745901) (← links)
- De Bruijn's syntax and reductional behaviour of \(\lambda\)-terms: the untyped case (Q1764799) (← links)
- Some results on extensionality in lambda calculus (Q1765154) (← links)
- Normalisation for higher-order calculi with explicit substitutions (Q1770414) (← links)
- On the expressive power of abstract categorial grammars: Representing context-free formalisms (Q1770834) (← links)
