Sciweavers

58 search results - page 9 / 12
» Monadic Parsing in Haskell
Sort
View
JFP
2007
136views more  JFP 2007»
13 years 9 months ago
Practical type inference for arbitrary-rank types
Haskell’s popularity has driven the need for ever more expressive type system features, most of which threaten the decidability and practicality of Damas-Milner type inference. ...
Simon L. Peyton Jones, Dimitrios Vytiniotis, Steph...
AGP
1998
IEEE
14 years 2 months ago
Parsing with Non-Deterministic Functions
Parsing has been a traditional workbench for showing the virtues of declarative programming. Both logic and functional programming claim the ability of writing parsers in a natura...
Rafael Caballero, Francisco Javier López-Fr...
JUCS
2008
123views more  JUCS 2008»
13 years 9 months ago
Beyond ASCII - Parsing Programs with Graphical Presentations
: Proxima is a generic structure editor suitable for a wide range of structured document types. It allows edit operations on the document structure as well as on its screen represe...
Martijn M. Schrage, S. Doaitse Swierstra
HASKELL
2009
ACM
14 years 4 months ago
Push-pull functional reactive programming
Functional reactive programming (FRP) has simple and powerful semantics, but has resisted efficient implementation. In particular, most past implementations have used demand-driv...
Conal M. Elliott
ESOP
2000
Springer
14 years 1 months ago
Type Classes with Functional Dependencies
Abstract. Type classes in Haskell allow programmers to define functions that can be used on a set of different types, with a potentially different implementation in each case. For ...
Mark P. Jones