Sciweavers

687 search results - page 98 / 138
» Feature (De)composition in Functional Programming
Sort
View
POPL
1990
ACM
14 years 25 days ago
Higher-Order Modules and the Phase Distinction
Typed -calculus is an important tool in programming language research because it provides an extensible framework for studying language features both in isolation and in their rel...
Robert Harper, John C. Mitchell, Eugenio Moggi
CORR
2006
Springer
119views Education» more  CORR 2006»
13 years 8 months ago
Enhanced Prolog Remote Predicate Call Protocol
Following the ideas of the Remote Procedure Call model, we have developed a logic programming counterpart, naturally called Prolog Remote Predicate Call (Prolog RPC) [1]. The Prol...
Alin Suciu, Kalman Pusztai, Andrei Diaconu
JFP
2006
90views more  JFP 2006»
13 years 8 months ago
Regular expression filters for XML
XML data are described by types involving regular expressions. This raises the question of what language feature is convenient for manipulating such data. Previously, we have give...
Haruo Hosaya
ESOP
2006
Springer
14 years 14 days ago
Haskell Is Not Not ML
We present a typed calculus IL ("intermediate language") which supports the embedding of ML-like (strict, eager) and Haskell-like (non-strict, lazy) languages, without fa...
Ben Rudiak-Gould, Alan Mycroft, Simon L. Peyton Jo...
ML
2008
ACM
13 years 8 months ago
Unrestricted pure call-by-value recursion
Call-by-value languages commonly restrict recursive definitions by only allowing functions and syntactically explicit values in the right-hand sides. As a consequence, some very a...
Johan Nordlander, Magnus Carlsson, Andy Gill