Skip to content
<title>Channels - A Classical Realizability Model arising from a Stable Model of Untyped Lambda Calculus :: FRELIP Discovery
Home
Search
Guides
Journals
Learning
FRELIP Discovery Search
Open Access Catalog for African Scholarship
Channels
A Classical Realizability Model arising from a Stable Model of Untyped Lambda Calculus
Search for more channels:
Similar Items: A Classical Realizability Model arising from a Stable Model of Untyped Lambda Calculus
Channel Options
View Record
Explore related channels
Quick Look
Call-by-value Termination in the Untyped lambda-calculus
Quick Look
Ordered Models of the Lambda Calculus
Quick Look
Addressing Machines as models of lambda-calculus
Quick Look
The Safe Lambda Calculus
Quick Look
Lineal: A linear-algebraic Lambda-calculus
Quick Look
Semantics of Typed Lambda-Calculus with Constructors
Quick Look
On Constructor Rewrite Systems and the Lambda Calculus
Quick Look
Intersection Types for the lambda-mu Calculus
Quick Look
Reasonable Space for the ${lambda}$-Calculus, Logarithmically
Quick Look
Typed realizability for first-order classical analysis
Quick Look
Light Logics and the Call-by-Value Lambda Calculus
Quick Look
RPO, Second-order Contexts, and Lambda-calculus
Quick Look
Encoding many-valued logic in $lambda$-calculus
Quick Look
The extensional realizability model of continuous functionals and three weakly non-constructive classical theorems
Quick Look
Standardization and Conservativity of a Refined Call-by-Value lambda-Calculus
Quick Look
A new coinductive confluence proof for infinitary lambda calculus
Quick Look
A Strong Bisimulation for a Classical Term Calculus
Quick Look
Extending the Extensional Lambda Calculus with Surjective Pairing is Conservative
Quick Look
Nominal Coalgebraic Data Types with Applications to Lambda Calculus
Quick Look
Existential witness extraction in classical realizability and via a negative translation
Quick Look
Preservation of Strong Normalisation modulo permutations for the structural lambda-calculus
Quick Look
Proving Noninterference by a Fully Complete Translation to the Simply Typed lambda-calculus
Quick Look
A Faithful and Quantitative Notion of Distant Reduction for the Lambda-Calculus with Generalized Applications
Quick Look
A revised completeness result for the simply typed $lambdamu$-calculus using realizability semantics
Load more items
View Record
Prev
Explore related channels
Next
