A Characterisation of Lambda Definability with Sums Via T T-Closure Operators

Authors:
Shin-Ya Katsumata
Affiliations:
Research Institute for Mathematical Sciences, Kyoto University, Kyoto, Japan 606-8502
Venue:
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
Year:
2008

Citing 18
Cited 2

Introduction to higher order categorical logic

Introduction to higher order categorical logic
Linear logic

Theoretical Computer Science
Categories and computer science

Categories and computer science
A characterization of lambda definability in categorical models of implicit polymorphism

Theoretical Computer Science
Operational reasoning for functions with local state

Higher order operational techniques in semantics
Representation independence and data abstraction

POPL '86 Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Remarks on Isomorphisms in Typed Lambda Calculi with Empty and Sum Types

LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
A New Characterization of Lambda Definability

TLCA '93 Proceedings of the International Conference on Typed Lambda Calculi and Applications
ßn-Equality for Coproducts

TLCA '95 Proceedings of the Second International Conference on Typed Lambda Calculi and Applications
Lambda Definability with Sums via Grothendieck Logical Relations

TLCA '99 Proceedings of the 4th International Conference on Typed Lambda Calculi and Applications
Equality Between Functionals in the Presence of Coproducts

LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
Normalization by Evaluation for Typed Lambda Calculus with Coproducts

LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
Extensional normalisation and type-directed partial evaluation for typed lambda calculus with sums

Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Parametric polymorphism and operational equivalence

Mathematical Structures in Computer Science
Recursive Polymorphic Types and Parametricity in an Operational Framework

LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
A typed, compositional logic for a stack-based abstract machine

APLAS'05 Proceedings of the Third Asian conference on Programming Languages and Systems
Reducibility and ⊤⊤-lifting for computation types

TLCA'05 Proceedings of the 7th international conference on Typed Lambda Calculi and Applications
A semantic formulation of ⊤⊤-lifting and logical predicates for computational metalanguage

CSL'05 Proceedings of the 19th international conference on Computer Science Logic

Relating computational effects by ⊤⊤-lifting

ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Relating computational effects by ττ-lifting

Information and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We give a new characterisation of morphisms that are definable by the interpretation of the simply typed lambda calculus with sums in anybi-Cartesian closed category. The 茂戮驴茂戮驴-closure operator will be used to constructthe category in which the collection of definable morphisms at sum types can be characterised as the coproducts of such collections at lower types.