58 search results - page 8 / 12 » Monadic Parsing in Haskell |
APLAS
2008
ACM
14 years 11 months ago
2008
ACM
Abstract. We propose c2-calculus, which is a second-order polymorphic call-by-value calculus with extensional universal types. Unlike product types or function types in call-by-val...
102
click to vote
CALCO
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. Monads are a well-established tool for modelling various computational effects. They form the semantic basis of Moggi’s computational metalanguage, the metalanguage of ...
LFP
1990
14 years 10 months ago
1990
Category theorists invented monads in the 1960's to concisely express certain aspects of universal algebra. Functional programmers invented list comprehensions in the 1970�...
CORR
2010
Springer
14 years 8 months ago
2010
Springer
Abstract. We present two novel approaches to parsing context-free languages. The first approach is based on an extension of Brzozowski’s derivative from regular expressions to c...
FP
1995
15 years 29 days ago
1995
We describe a natural language parser that uses type information to determine the grammatical structure of simple sentences and phrases. This stands in contrast to studies of type...