Sciweavers

47 search results - page 2 / 10
» Realization of natural language interfaces using lazy functi...
Sort
View
PLILP
1995
Springer
13 years 11 months ago
A Complete Narrowing Calculus for Higher-Order Functional Logic Programming
Abstract. Using higher-order functions is standard practice in functional programming, but most functional logic programming languages that have been described in the literature la...
Koichi Nakahara, Aart Middeldorp, Tetsuo Ida
CHI
2005
ACM
14 years 8 months ago
Programmatic semantics for natural language interfaces
An important way of making interfaces usable by nonexpert users is to enable the use of natural language input, as in natural language query interfaces to databases, or MUDs and M...
Hugo Liu, Henry Lieberman
ESOP
2012
Springer
12 years 3 months ago
The Call-by-Need Lambda Calculus, Revisited
The existing call-by-need λ calculi describe lazy evaluation via equational logics. A programmer can use these logics to safely ascertain whether one term is behaviorally equivale...
Stephen Chang, Matthias Felleisen
ICFP
2003
ACM
14 years 7 months ago
Functional automatic differentiation with dirac impulses
Functional Reactive Programming (FRP) is a framework for reactive programming in a functional setting. FRP has been applied to a number of domains, such as graphical animation, gr...
Henrik Nilsson
PADL
2007
Springer
14 years 1 months ago
Rewriting Haskell Strings
Abstract The Haskell String type is notoriously inefficient. We introduce a new data type, ByteString, based on lazy lists of byte arrays, combining the speed benefits of strict a...
Duncan Coutts, Don Stewart, Roman Leshchinskiy