The following pages link to A new type assignment for λ-terms (Q3208623):
Displaying 49 items.
- Higher-order subtyping and its decidability (Q598199) (← links)
- Completeness and partial soundness results for intersection and union typing for \(\overline{\lambda}\mu\tilde{\mu}\) (Q636376) (← links)
- Formal neighbourhoods, combinatory Böhm trees, and untyped normalization by evaluation (Q651316) (← links)
- From CML to its process algebra (Q672132) (← links)
- Coppo-Dezani types do not correspond to propositional logic (Q787128) (← links)
- A completeness result for a realisability semantics for an intersection type system (Q882122) (← links)
- Calculi, types and applications: essays in honour of M. Coppo, M. Dezani-Ciancaglini and S. Ronchi della Rocca (Q930863) (← links)
- A typed lambda calculus with intersection types (Q930870) (← links)
- Characterizing strong normalization in the Curien-Herbelin symmetric lambda calculus: extending the Coppo-Dezani heritage (Q930871) (← links)
- A characterization of F-complete type assignments (Q1089331) (← links)
- Type theories, normal forms, and \(D_{\infty}\)-lambda-models (Q1102936) (← links)
- On Church's formal theory of functions and functionals. The \(\lambda\)- calculus: Connections to higher type recursion theory, proof theory, category theory (Q1120558) (← links)
- Implementing the `Fool's model' of combinatory logic (Q1181718) (← links)
- Type reconstruction in finite rank fragments of the second-order \(\lambda\)-calculus (Q1193590) (← links)
- Constructing type systems over an operational semantics (Q1199709) (← links)
- Types with intersection: An introduction (Q1201298) (← links)
- Typing untyped \(\lambda\)-terms, or reducibility strikes again! (Q1295368) (← links)
- Higher-order subtyping (Q1392282) (← links)
- System ST toward a type system for extraction and proofs of programs (Q1400600) (← links)
- Nominal essential intersection types (Q1643145) (← links)
- How to think of intersection types as Cartesian products (Q1744395) (← links)
- Normalization without reducibility (Q1840460) (← links)
- Intersection types for explicit substitutions (Q1887145) (← links)
- Infinite intersection types (Q1887155) (← links)
- The bang calculus revisited (Q2039931) (← links)
- The spirit of node replication (Q2233421) (← links)
- Full abstraction for polymorphic \(\pi \)-calculus (Q2474052) (← links)
- Classical \(F_{\omega}\), orthogonality and symmetric candidates (Q2482840) (← links)
- Reasoning About Call-by-need by Means of Types (Q2811356) (← links)
- Reducibility (Q2842839) (← links)
- Definability and Full Abstraction (Q2864154) (← links)
- Intersection Types for the Resource Control Lambda Calculi (Q3105748) (← links)
- Call-by-Value Non-determinism in a Linear Logic Type Discipline (Q3455843) (← links)
- Characterising Strongly Normalising Intuitionistic Sequent Terms (Q3499751) (← links)
- (Q3890661) (← links)
- (Q3910511) (← links)
- Ordinal analysis of simple cases of bar recursion (Q3912574) (← links)
- A model for syntactic control of interference (Q4286528) (← links)
- A classification of intersection type systems (Q4532620) (← links)
- A resource aware semantics for a focused intuitionistic calculus (Q4559602) (← links)
- Hyperformulae, Parallel Deductions and Intersection Types (Q4916178) (← links)
- (Q5076058) (← links)
- (Q5076060) (← links)
- (Q5090978) (← links)
- (Q5111320) (← links)
- Tight typings and split bounds, fully developed (Q5120229) (← links)
- (Q5208874) (← links)
- Non-Deterministic Functions as Non-Deterministic Processes (Extended Version) (Q6076174) (← links)
- Node Replication: Theory And Practice (Q6192004) (← links)