Theoretical Computer Science
LFP '90 Proceedings of the 1990 ACM conference on LISP and functional programming
Notions of computation and monads
Information and Computation
Research topics in functional programming
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 - Special issue on state in programming languages (part I)
Proceedings of the 9th International Conference on Mathematical Foundations of Programming Semantics
A Mixed Linear and Non-Linear Logic: Proofs, Terms and Models (Extended Abstract)
CSL '94 Selected Papers from the 8th International Workshop on Computer Science Logic
The Girard Translation Extended with Recursion
CSL '94 Selected Papers from the 8th International Workshop on Computer Science Logic
Bridging the gulf: a common intermediate language for ML and Haskell
POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
ACM Transactions on Programming Languages and Systems (TOPLAS)
Axiomatizing Fully Complete Models for ML Polymorphic Types
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Call-by-Push-Value: A Subsuming Paradigm
TLCA '99 Proceedings of the 4th International Conference on Typed Lambda Calculi and Applications
A Study of Abramsky's Linear Chemical Abstract Machine
TLCA '99 Proceedings of the 4th International Conference on Typed Lambda Calculi and Applications
Linearly Used Effects: Monadic and CPS Transformations into the Linear Lambda Calculus
FLOPS '02 Proceedings of the 6th International Symposium on Functional and Logic Programming
Directions in Functional Programming for Real(-Time) Applications
EMSOFT '01 Proceedings of the First International Workshop on Embedded Software
The call-by-value λ-calculus: a semantic investigation
Mathematical Structures in Computer Science
Girard translation and logical predicates
Journal of Functional Programming
Program equivalence in a linear functional language
Journal of Functional Programming
Syntactic accidents in program analysis: on the impact of the CPS transformation
Journal of Functional Programming
Computational types from a logical perspective
Journal of Functional Programming
Journal of Functional Programming
Call-by-push-value: Decomposing call-by-value and call-by-name
Higher-Order and Symbolic Computation
Weak linearization of the lambda calculus
Theoretical Computer Science - Applied semantics: Selected topics
Linear types for computational effects
Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A linear-non-linear model for a computational call-by-value lambda calculus
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Enriching an effect calculus with linear types
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
A semantic model for graphical user interfaces
Proceedings of the 16th ACM SIGPLAN international conference on Functional programming
Semantics for graphical user interfaces
TLDI '12 Proceedings of the 8th ACM SIGPLAN workshop on Types in language design and implementation
Proceedings of the 17th ACM SIGPLAN international conference on Functional programming
Universal properties of impure programming languages
POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
| Hi-index | 0.00 |
Models of intuitionistic linear logic also provide models of Moggi's computational metalanguage. We use the adjoint presentation of these models and the associated adjoint calculus to show that three translations, due mainly to Moggi, of the lambda calculus into the computational metalanguage (direct, call-by-name and call-by-value) correspond exactly to three translations, due mainly to Girard, of intuitionistic logic into intuitionistic linear logic. We also consider extending these results to languages with recursion.