Language Prototyping System

Latest News

1. 13-9-00 Version 1.0 works with GHC and Hugs98
2. 28-01-99 First Version works under Hugs98

FAQ

What is LPS?

LPS is a system for writing modular interpreters implemented in Haskell. It is part of ongoing research for my PhD Thesis. The goal is to provide a framework for the development of language prototypes.

Downloading LPS

The latest version can be downloaded from: http://www.di.uniovi.es/~labra/FTP/LPS.tar.gz.

You can load the system using both Hugs98 and GHC. It needs multiparameter type classes and overlapping instances

Documentation

• L. Duponcheel, Writing modular interpreters using Catamorphisms, subtypes and monad transformers. Research Report (draft) (Utrecht University, 1995).
• D. Espinosa, Semantic Lego, PhD. Thesis. (Columbia University, 1995).
• M. Fokkinga, Monadic Maps and Folds for Arbitrary Datatypes. Technical Report.(Dept. INF, University of Twente, 1994).
• W. L. Harrison, S. N. Kamin, Modular Compilers Based on Monad Transformers, IEEE Computer Society International Conference on Computer Languages, Loyola University, Chicago (1998).
• Z. Hu , H. Iwasaki, Promotional Transformation of Monadic Programs, Fuji International Workshop on Functional and Logic Programming, Susono, July 1995, pp.196-210. World Scientific.
• J. Hughes, Generalising Monads to Arrows, Fourth International Conference on Mathematics of Program Construction, Baastad, Sweden, 15- 17 June, 1998
• J. E. Labra G. An Implementation of Modular Monadic Semantics using Folds and Monadic Folds . Workshop on Research Themes on Functional Programming, 3rd International Summer School on Advanced Functional Programming. Braga, Portugal (1998)
• Jose E. Labra G., J. M. Cueva L., M. C. Luengo Díez, Language Prototyping using Modular Monadic Semantics, 3rd Latin-American Conference on Functional Programming, 8-9, March, 1999, Recife - Brasil, Also Available the PowerPoint Presentation (compressed)
• Jose E. Labra G., J. M. Cueva L., M. C. Luengo Díez, Modular Development of Interpreters from Semantic Building Blocks, The 12th Nordic Workshop on Programming Theory, Bergen-Norway, October 11-13, 2000. You can download the Extended Abstract or the presentation slides.
• S. Liang, P. Hudak, M. Jones, Monad transformers and modular interpreters, POPL'94: 21st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, San Francisco, California (1995).
• S. Liang, P. Hudak, Modular denotational semantics for compiler construction, ESOP'96: 6th European Symposium on Programming, Linkoping, Sweden (Springer-Verlag, 1996).
• S. Liang, Modular Monadic Semantics and Compilation, PhD. Thesis. Computer Science, Yale (Yale University, 1998).
• E. Meijer, J. Jeuring, Merging monads and folds for functional programming, First International Spring School on Advanced Functional Programming Techniques (Springer-Verlag, 1995).
• E. Moggi, An abstract view of programming languages. Technical Report.ECS-LFCS-90-113 (University of Edinburgh, 1989).
• Y. Onoue, Z. Hu, H. Iwasaki, M. Takeichi, A Calculational Fusion System HYLO , IFIP TC 2 Working Conference on Algorithmic Languages and Calculi. Le Bischenberg, France, February 1997, pp.76-106. Chapman&Hall.
• A. Pardo, Fusion of Monadic (Co)Recursive Programs, In MPC'98 Workshop on Generic Programming, Marstrand, Sweden, June 1998
• G. L. Steele, Building Interpreters by composing Monads, POPL' 94: 21st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Portland, Oregon (ACM Press, 1994).
• K. Wansbrough, J. Hamer, A Modular Monadic Action Semantics, Domain Specific Languages, Santa Barbara, California (The USENIX Association, 1997).

Contact Information

Related Pages

• Lisa A. Walton maintains a page about monads
• I also maintain pages about Advanced Programming Languages and Logic for Computer Science