Entities Mentioned

• Haskell
• Chalmers University of Technology
• Graham Hutton
• Mark P.
• University of Edinburgh
• University of Glasgow
• Landin
• University of Nottingham
• Parser

1. 1
   
   
   Graham Hutton
   University of Nottingham
   
   Erik Meijer
   University of Utrecht Appears as technical report NOTTCS-TR-96-4, Department of Computer Science, University of Nottingham, 1996
   
   Abstract
   In functional programming, a popular approach to building recursive descent parsers is to model parsers as functions, and to define higher-order functions (or combinators ) that implement grammar constructions such as sequencing, choice, and repetition. Such parsers form an insta (Read Full Article)
   
   

   Related Articles

   • parsec.pdf (application/pdf Object)
   • also mentions University of Nottingham
   • Functional Programming with Overloading and Higher-Order Polymorphism - Jones (ResearchIndex)
   • also mentions Mark P.
   • A Brief Introduction to Functional Reactive Programming and Yampa
   • also published in cs.nott.ac.uk
   • A Taste of Haskell
   • also written by wibblefarmer
   • The Haskell Road to Logic, Maths and Programming (Texts in Computing S.): Kees Doets, van, Jan Eijck
   • also written by wibblefarmer

   • Phil Wadler
   • also mentions University of Edinburgh
   • history.pdf (application/pdf Object)
   • also mentions Landin
   • Haskell Weekly News: November 11, 2007
   • also mentions Parser
   • Clowns to the left of me, jokers to the right
   • also published in cs.nott.ac.uk
   • Monadic Parsing in Haskell
   • also published in cs.nott.ac.uk

Login to comment.