Sciweavers

4757 search results - page 122 / 952
» Monads for Functional Programming
Sort
View
150
Voted
ICFP
2006
ACM
16 years 2 months ago
A pattern for almost compositional functions
This paper introduces a pattern for almost compositional functions over recursive data types, and over families of mutually recursive data types. Here "almost compositional&q...
Aarne Ranta, Björn Bringert
141
Voted
SAC
2004
ACM
15 years 8 months ago
Seamless integration of rule-based knowledge and object-oriented functionality with linguistic symbiosis
Software applications often contain implicit knowledge in addition to functionality which is inherently object-oriented. Many approaches and systems exist that focus on separating...
Maja D'Hondt, Kris Gybels, Viviane Jonckers
118
Voted
ICFP
2006
ACM
16 years 2 months ago
Delimited dynamic binding
Dynamic binding and delimited control are useful together in many settings, including Web applications, database cursors, and mobile code. We examine this pair of language feature...
Oleg Kiselyov, Chung-chieh Shan, Amr Sabry
ICFP
2002
ACM
16 years 2 months ago
Packrat parsing: : simple, powerful, lazy, linear time, functional pearl
Packrat parsing is a novel technique for implementing parsers in a lazy functional programming language. A packrat parser provides the power and flexibility of top-down parsing wi...
Bryan Ford
120
Voted
AAAI
1990
15 years 3 months ago
Inductive Synthesis of Equational Programs
An equational approach to the synthesis of functional and logic programs is taken. Typically, a target program contains equations that are only true in the standard model of the g...
Nachum Dershowitz, Eli Pinchover