P. N. Benton and Philip Wadler. Linear logic, monads, and the lambda calculus. In E. Clarke, editor, Proceedings of the 11th Annual Symposium on Logic in Computer Science, pages 420-431, New Brunswick, New Jersey, July 1996. IEEE Computer Society Press. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
A Concurrent Logical Framework: the - Propositional Fragment Kevin (Correct)
....logic programming by Bekkers and Tarau [BT95] concentrates on the use of monads for data structures and all solution predicate. This is quite di erent from our application and concerned neither with additional logical connectives nor a true extension of the operational semantics. Benton and Wadler [BW96] explore the relationship of Moggi s monadic meta language and term calculi for linear logic with Benton s adjoint calculus, which bears some intriguing similarities with CLF, but is not a type theory and does not identify the logical connectives inherited from lax logic and linear logic as we do ....
P. N. Benton and Philip Wadler. Linear logic, monads, and the lambda calculus. In E. Clarke, editor, Proceedings of the 11th Annual Symposium on Logic in Computer Science, pages 420-431, New Brunswick, New Jersey, July 1996. IEEE Computer Society Press.
A Concurrent Logical Framework: The Propositional.. - Watkins, Cervesato.. (2003) (2 citations) (Correct)
....logic programming by Bekkers and Tarau [BT95] concentrates on the use of monads for data structures and all solution predicate. This is quite di#erent from our application and concerned neither with additional logical connectives nor a true extension of the operational semantics. Benton and Wadler [BW96] explore the relationship of Moggi s monadic meta language and term calculi for linear logic with Benton s adjoint calculus, which bears some intriguing similarities with CLF, but is not a type theory and does not identify the logical connectives inherited from lax logic and linear logic as we do ....
P. N. Benton and Philip Wadler. Linear logic, monads, and the lambda calculus. In E. Clarke, editor, Proceedings of the 11th Annual Symposium on Logic in Computer Science, pages 420--431, New Brunswick, New Jersey, July 1996. IEEE Computer Society Press.
Operational Interpretations of Linear Logic - Turner, Wadler (1998) (25 citations) (Correct)
....the classical and linear parts of the calculus, then all the problems we have described here arise again. We conjecture that, just in the case of linear logic, the single pointer property for Benton s calculus depends crucially on how much recomputation one is willing to do. Benton and Wadler [BW96] use Benton s model to relate three standard mappings from lambda calculus (direct, call by name, and call by value) into Benton s linear calculus and Moggi s monadic metalanguage. Morrisett, Felleisen, and Harper [MFH95] present models of memory management which allow them to formulate and prove ....
Nick Benton and Philip Wadler. Linear logic, monads, and the lambda calculus. In Symposium on Logic in Computer Science. IEEE Computer Society, 1996.
Types and Models for Higher-Order Action Calculi - Gardner, Hasegawa (1997) (2 citations) (Correct)
....links action calculi with intuitionistic linear type theory [Bar96,Ben95] and proves conservativity results for various extensions of action calculi incorporating the results given here. This work focusses more extensively on relating type theories by comparing their categorical models. See also [BW96] for a related work on linear type theory and notions of computation. Second, it is natural to extend our theories by replacing the let bindings in the type theories by recursive letrec bindings: that is, introducing cyclic sharing as studied in graph rewriting theory, see for instance [AA95] ....
N. Benton and P. Wadler, Linear logic, monads, and the lambda calculus. In Proc. 11th Symposium on Logic in Computer Science (LICS'96), 1996.
Operational Interpretations of Linear Logic - Turner, Wadler (1998) (25 citations) (Correct)
....the classical and linear parts of the calculus, then all the problems we have described here arise again. We conjecture that, just in the case of linear logic, the single pointer property for Benton s calculus depends crucially on how much recomputation one is willing to do. Benton and Wadler [BW96] use Benton s model to relate three standard mappings from lambda calculus (direct, call by name, and call by value) into Benton s linear calculus and Moggi s monadic metalanguage. Morrisett, Felleisen, and Harper [MFH95] present models of memory management which allow them to formulate and prove ....
Nick Benton and Philip Wadler. Linear logic, monads, and the lambda calculus. In Symposium on Logic in Computer Science. IEEE Computer Society, 1996.
A Concurrent Logical Framework: The Propositional.. - Watkins, Cervesato.. (2003) (2 citations) (Correct)
No context found.
P. N. Benton and Philip Wadler. Linear logic, monads, and the lambda calculus. In E. Clarke, editor, Proceedings of the 11th Annual Symposium on Logic in Computer Science, pages 420-431, New Brunswick, New Jersey, July 1996. IEEE Computer Society Press.
A Concurrent Logical Framework: The Propositional.. - Watkins, Cervesato.. (2003) (2 citations) (Correct)
No context found.
P. N. Benton and Philip Wadler. Linear logic, monads, and the lambda calculus. In E. Clarke, editor, Proceedings of the 11th Annual Symposium on Logic in Computer Science, pages 420--431, New Brunswick, New Jersey, July 1996. IEEE Computer Society Press.
Linear Logic and Noncommutativity in the Calculus of Structures - Straßburger (2003) (Correct)
No context found.
Nick Benton and Philip Wadler. Linear logic, monads, and the lambda calculus. In 11'th IEEE Symposium on Logic in Computer Science, 1996.
Linear Logic and Noncommutativity in the Calculus of Structures - Straßburger (2003) (21 citations) (Correct)
No context found.
Nick Benton and Philip Wadler. Linear logic, monads, and the lambda calculus. In 11'th IEEE Symposium on Logic in Computer Science, 1996.
A Concurrent Logical Framework: The Propositional.. - Watkins, Cervesato.. (2003) (2 citations) (Correct)
No context found.
P. N. Benton and Philip Wadler. Linear logic, monads, and the lambda calculus. In E. Clarke, editor, Proceedings of the 11th Annual Symposium on Logic in Computer Science, pages 420--431, New Brunswick, New Jersey, July 1996. IEEE Computer Society Press.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC