Genericity through stratification

Cites work

scientific article; zbMATH DE number 7226008 (Why is no real title available?)
scientific article; zbMATH DE number 3695144 (Why is no real title available?)
scientific article; zbMATH DE number 92599 (Why is no real title available?)
scientific article; zbMATH DE number 3523517 (Why is no real title available?)
scientific article; zbMATH DE number 1332646 (Why is no real title available?)
scientific article; zbMATH DE number 6825409 (Why is no real title available?)
scientific article; zbMATH DE number 3423547 (Why is no real title available?)
A Semantical and Operational Account of Call-by-Value Solvability
A Syntactic Characterization of the Equality in Some Models for the Lambda Calculus
A characterization of terms of the λI-calculus having a normal form
A compiled implementation of strong reduction
A lambda calculus satellite
A new type assignment for λ-terms
An Operational Account of Call-by-Value Minimal and Classical λ-Calculus in “Natural Deduction” Form
An abstract factorization theorem for explicit substitutions
An extension of basic functionality theory for -calculus
Call-By-Push-Value from a Linear Logic Point of View
Call-by-name, call-by-value and the $\lambda$-calculus
Call-by-value Solvability
Call-by-value solvability, revisited
Collapsing non-idempotent intersection types
Complexity of Strongly Normalising λ-Terms via Non-idempotent Intersection Types
Effective λ-models versus recursively enumerable λ-theories
Foundations of Software Science and Computation Structures
From computation to foundations via functions and application: The $\lambda$-calculus and its webbed models
Full intersection types and topologies in lambda calculus
Lambda Theories of Effective Lambda Models
New results on Morris's observational theory: the benefits of separating the inseparable
New semantical insights into call-by-value $\lambda$-calculus
No solvable lambda-value term left behind
Non-idempotent intersection types for the lambda-calculus
On the characterization of models of $\mathcal{H}^*$
Open call-by-value
Preservation of strong normalisation modulo permutations for the structural -calculus
Programming language semantics: It’s easy as 1,2,3
Proving the genericity lemma by leftmost reduction is simple
Quantitative types for the linear substitution calculus
Solvability = typability + inhabitation
Strong call-by-value and multi types
The Relation between Computational and Denotational Properties for Scott’s ${\text{D}}_\infty $-Models of the Lambda-Calculus
The bang calculus and the two Girard's translations
The bang calculus revisited
The bang calculus revisited
The calculi of lambda-conversion.
The call-by-need lambda calculus
The lambda calculus. Its syntax and semantics. Rev. ed.
The parametric lambda calculus. A metamodel for computation.
The permutative $\lambda $-calculus
The structural $\lambda $-calculus
Theoretical Pearls:Representing ‘undefined’ in lambda calculus
Tight typings and split bounds, fully developed
Uniformity and the Taylor expansion of ordinary lambda-terms

This page was built for publication: Genericity through stratification

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6970279)