Introduction to higher order categorical logic
Introduction to higher order categorical logic
Computational lambda-calculus and monads
Proceedings of the Fourth Annual Symposium on Logic in computer science
Notions of computation and monads
Information and Computation
Reasoning about programs in continuation-passing style.
LFP '92 Proceedings of the 1992 ACM conference on LISP and functional programming
The essence of compiling with continuations
PLDI '93 Proceedings of the ACM SIGPLAN 1993 conference on Programming language design and implementation
New foundations for fixpoint computations: FIX-hyperdoctrines and the FIX-logic
Information and Computation - Special issue: Selections from 1990 IEEE symposium on logic in computer science
Lisp and Symbolic Computation
Axiomatic domain theory in categories of partial maps
Axiomatic domain theory in categories of partial maps
ICFP '00 Proceedings of the fifth ACM SIGPLAN international conference on Functional programming
Models of Sharing Graphs: A Categorical Semantics of Let and Letrec
Models of Sharing Graphs: A Categorical Semantics of Let and Letrec
Uncertain Programming
The Definition of Standard ML
Using a Continuation Twice and Its Implications for the Expressive Power of call/cc
Higher-Order and Symbolic Computation
Lambda-My-Calculus: An Algorithmic Interpretation of Classical Natural Deduction
LPAR '92 Proceedings of the International Conference on Logic Programming and Automated Reasoning
Duality between Call-by-Name Recursion and Call-by-Value Iteration
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
Declarative Continuations: an Investigation of Duality in Programming Language Semantics
Category Theory and Computer Science
Complete Axioms for Categorical Fixed-Point Operators
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Control categories and duality: on the categorical semantics of the lambda-mu calculus
Mathematical Structures in Computer Science
Premonoidal categories and notions of computation
Mathematical Structures in Computer Science
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
On the call-by-value CPS transform and its semantics
Information and Computation
Lightweight fusion by fixed point promotion
Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Parameterizations and Fixed-Point Operators on Control Categories
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2003, Selected Papers
Combining algebraic effects with continuations
Theoretical Computer Science
Extensional Universal Types for Call-by-Value
APLAS '08 Proceedings of the 6th Asian Symposium on Programming Languages and Systems
Parameterizations and fixed-point operators on control categories
TLCA'03 Proceedings of the 6th international conference on Typed lambda calculi and applications
Polarized proof nets with cycles and fixpoints semantics
TLCA'03 Proceedings of the 6th international conference on Typed lambda calculi and applications
Relating computational effects by ⊤⊤-lifting
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
On Protection by Layout Randomization
ACM Transactions on Information and System Security (TISSEC)
Parameterizations and Fixed-Point Operators on Control Categories
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2003, Selected Papers
Relating computational effects by ττ-lifting
Information and Computation
| Hi-index | 0.00 |
We propose an axiomatization of fixpoint operators in typed call-by-value programming languages, and give its justifications in two ways. First, it is shown to be sound and complete for the notion of uniform T-fixpoint operators of Simpson and Plotkin. Second, the axioms precisely account for Filinski's fixpoint operator derived from an iterator (infinite loop constructor) in the presence of first-class continuations, provided that we define the uniformity principle on such an iterator via a notion of effect-freeness (centrality). We then explain how these two results are related in terms of the underlying categorical structures.