Miley Semmelroth
- AFM+95.Zena M. Ariola, Matthias FeUeisen, John Maraist, Martin Odersky, and Philip Wadler. A call-by-need lambda cMculus. In the A CM SIGPLAN-$IGA CT Symposium on Principles of Programming Languages, pages 233-246. AGM Press, New York, 1995. Google Scholar
Digital Library
- AS98.Zena M. Ariola and Amr Sabry. Correctness of monadic state: An imperative cedl-by-need calculus. In the A CM SIGPLAN-StGACT Symposium on Principles of Programming Languages, pages 62-74. ACM Press, New York, 1998. Google ScholarDigital Library
- CO94.K. Chen and M. Odersky. A type system for a lambda calculus with assignment. In Theoretical Aspects o/Computer SoBware. Springer Verlag, LNCS 789, 1994. Google ScholarDigital Library
- FH92.Matthias Felleisen and R. Hieb. The revised report on the syntactic theories of :sequential control and state. Theoret. Comput. Sci., 102:235- 271, 1992. Tech. Rep. 89-100, Rice University.Google Scholar
- Fil94.Andrzej Filinski. Representing monads. In the A CM $IGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 446- 457, 1994. Google ScholarDigital Library
- JG91.Pierre Jouvelot and David Gifford. Algebraic reconstruction of types and effects. In Conference Record of the Eighteenth Annual ACM Symposium on Principles o.f Programming Languages, Orlando, Florida, pages 303-310. ACM Press, January 1991. Google ScholarDigital Library
- Kie99.Richard Kieburtz. Taming effects with monodic typing. ACM $IGPLAN Notice.s, 34(1):51-62, January 1999. Google ScholarDigital Library
- LG88.Jon M. Lucassen and David K. Gifford. Polymorphic effect systems. In Conference Record of the Fifteenth Annual A CM Symposium on Principles of Programming Languages. ACM, ACM Press, January 1988. Google ScholarDigital Library
- LP94.John Launchbury and Simon L. Peyton Jones. Lazy functional state threads. In the ACM SIG- PLAN Con)terence on Programming Language Design and Implementation, pages 24-35, 1994. Google ScholarDigital Library
- LP95.John Launchbury and Simon L Peyton Jones. State in Haskell. Lisp Symbol. Comput., 8'193- 341, 1995. Google ScholarDigital Library
- LS97.John Launchbury and Amr Sabry. Monadic state: Axiomatization and type safety. In the A CM SIGPLAN International Con/erence on Functional Programming, pages 227-238. ACM Press, New York, 1997. Google ScholarDigital Library
- Mog89.Eugenio Moggi. Computational lambda-calculus and monads, in the IEEE Symposium on Logic in Computer Science, pages 14-23, 1989. Also appeared as: LFCS Report ECS-LFCS-88-86, University of Edinburgh, 1988. Google ScholarDigital Library
- ORH93.Martin Odersky, Dan Rabin, and Paul Hudak. Call by name, assignment, and the lambda calculus. In the A CM SiGPLAN-SIGACT Symposium on Principles o/Programming Languages, pages 43-56. ACM Press, New York, January 1993. Google ScholarDigital Library
- Rab96.Dan Rabin. Calculi for Functional Programming Languages with Assignments. PhD thesis, Yale University, 1996. Technical Report YALEU/DCS/RR-1107. Google ScholarDigital Library
- Rey78.John C. Reynolds. Syntactic control of interference. In Proceedings of the Fifth Annual A CM Symposium on Principles of Programming Languages, pages 39-46, January 1978. Google ScholarDigital Library
- Sab98.Amr Sabry. What is a purely functional language? J. Functional Programming, 8(1):1-22, January 1998. Google ScholarDigital Library
- SRI91.V. Swgrup, Uday Reddy, and E. Ireland. Assignments for applicative languages. In the Conference on Functional Programming and Computer Architecture, pages 192-214, 1991. Google ScholarDigital Library
- TJ92.Jean-Pierre Talpin and P. Jouvelot. The type and effect discipline. In the IEEE Symposium on Logic in Computer Science, pages 162-173, June 1992.Google ScholarCross Ref
- Tof90.M ads Torte. Type inference for potymorphic references, in/. Comput., 89(1):1-34, November 1990. Google ScholarDigital Library
- TT93.Muds Tofte and Jean-Pierre Talpin. A theory of stack allocation in polymorphically typed languages. Technical Report 93/15, Department of Computer Science, Copenhagen University, July 1993.Google Scholar
- TT94.Muds Torte and Jean-Pierre Talpin. Implementing the call-by-value calculus using a stack of regions. In the A CM SIGPLAN-SIGACT Symposium on Principles o/Programming Languages, pages 188-201, 1994. Google ScholarDigital Library
- TT97.Muds Torte and Jean-Pierre Talpin. Regionbased memory management. Information and Computation, 132(2):109-176, February 1997. Google ScholarDigital Library
- Wad90.Philip Wadler. Comprehending monads. In A CM Conference on Lisp and Functional Programming, pages 61-78, 1990. Google ScholarDigital Library
- Wad98.Philip Wadler. The marriage of effects and monads. In International Conference on Functional Programming, pages 63-74, BMtimore, September 1998. ACM. Google ScholarDigital Library
- WF94.Andrew K. Wright and Matthias Felleisen. A syntactic approach to type soundness. In/. Cornput., 115(1):38-94, November 1994. Google ScholarDigital Library
- Wri95.Andrew K. Wright. Simple imperative polymorphism. Lisp and Symbolic Computation, 8(4):343-356, December 1995. Preliminary Version is Polymorphism for Imperative Languages without Imperative Types, Rice Technical Report TR93-200. Google ScholarDigital Library
Index Terms
- Monadic encapsulation in ML
Recommendations
Truthful monadic abstractions
IJCAR'12: Proceedings of the 6th international joint conference on Automated ReasoningIn intuitionistic sequent calculi, detecting that a sequent is unprovable is often used to direct proof search. This is for instance seen in backward chaining, where an unprovable subgoal means that the proof search must backtrack. In undecidable logics,...
On Monadic theories of monadic predicates
Fields of logic and computationPioneers of logic, among them J.R. Büchi, M.O. Rabin, S. Shelah, and Y. Gurevich, have shown that monadic second-order logic offers a rich landscape of interesting decidable theories. Prominent examples are the monadic theory of the successor structure ...
Monadic encapsulation of effects: a revised approach (extended version)
Launchbury and Peyton Jones came up with an ingenious idea for embedding regions of imperative programming in a pure functional language like Haskell. The key idea was based on a simple modification of Hindley-Milner's type system. Our first ...
Comments