scientific article; zbMATH DE number 3485758

Cited in

(36)

A family of syntactic logical relations for the semantics of Haskell-like languages
Word operation definable in the typed -calculus
On Church's formal theory of functions and functionals. The - calculus: Connections to higher type recursion theory, proof theory, category theory
Finitely stratified polymorphism
Characterizing complexity classes by higher type primitive recursive definitions
Intuitionistic propositional logic is polynomial-space complete
The typed lambda-calculus is not elementary recursive
Set-theoretical and other elementary models of the \(\lambda\)-calculus
Kripke models and the (in)equational logic of the second-order -calculus
On the semantics of the universal quantifier
Embedding of a free cartesian-closed category into the category of sets
Can LCF be topped! Flat lattice models of typed \(\lambda{}\)-calculus
Building continuous webbed models for system F
Equality between functionals in the presence of coproducts
Polymorphic extensions of simple type structures. With an application to a bar recursive minimization
What is the meaning of proofs?. A Fregean distinction in proof-theoretic semantics
Substitution structures
Fresh logic: Proof-theory and semantics for FM and nominal techniques
Selective strictness and parametricity in structural operational semantics, inequationally
Extended First-Order Logic
λ-definable functionals andβη conversion
A Constructive Semantic Approach to Cut Elimination in Type Theories with Axioms
Kripke Semantics for Martin-Löf’s Extensional Type Theory
scientific article; zbMATH DE number 7003195 (Why is no real title available?)
The Typed Böhm Theorem
Parametricity of extensionally collapsed term models of polymorphism and their categorical properties
POPLMark reloaded: mechanizing proofs by logical relations
A semantics for nabla
Constant time parallel computations in \(\lambda\)-calculus
Typed homomorphic relations extended with subtypes
Meaning and identity of proofs in a bilateralist setting: a two-sorted typed lambda-calculus for proofs and refutations
A note on logical PERs and reducibility. Logical relations strike again!
Extensional models for polymorphism
\(\lambda\)-definability of free algebras
Kripke-style models for typed lambda calculus
A characterization of lambda definable tree operations

This page was built for publication:

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