Relating computational effects by ⊤⊤-lifting

Authors:
Shin-Ya Katsumata
Affiliations:
Research Institute for Mathematical Sciences, Kyoto University, Kyoto, Japan
Venue:
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Year:
2011

Citing 19
Cited 1

Linear logic

Theoretical Computer Science
Representing monads

POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Foundations of programming languages

Foundations of programming languages
Representing layered monads

Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Representation independence and data abstraction

POPL '86 Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Axioms for Recursion in Call-by-Value

Higher-Order and Symbolic Computation
Monads and Effects

Applied Semantics, International Summer School, APPSEM 2000, Caminha, Portugal, September 9-15, 2000, Advanced Lectures
Notes on Sconing and Relators

CSL '92 Selected Papers from the Workshop on Computer Science Logic
A Fully Abstract Domain Model for the p-Calculus

LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Complete Axioms for Categorical Fixed-Point Operators

LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
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
On the relations between monadic semantics

Theoretical Computer Science
Inductive reasoning about effectful data types

ICFP '07 Proceedings of the 12th ACM SIGPLAN international conference on Functional programming
A Characterisation of Lambda Definability with Sums Via T T-Closure Operators

CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
Logical relations for monadic types†

Mathematical Structures in Computer Science
Handlers of Algebraic Effects

ESOP '09 Proceedings of the 18th European Symposium on Programming Languages and Systems: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
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

Information and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of establishing a relationship between two interpretations of base type terms of a λc-calculus with algebraic operations. We show that the given relationship holds if it satisfies a set of natural conditions. We apply this result to comparing interpretations of new name creation by two monads: Stark's new name creation monad [25] and a global counter monad.