4835 search results - page 182 / 967 » Refactoring Functional Programs |
71
Voted
PADL
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. A session type is an abstraction of a set of sequences of heterogeneous values sent and received over a communication channel. Session types can be used for specifying st...
95
Voted
ENTCS
2002
14 years 10 months ago
2002
Non-deterministic computations greatly enhance the expressive power of functional logic programs, but are often computationally expensive. We analyze a programming technique that ...
82
Voted
SIAMCOMP
2008
14 years 10 months ago
2008
The Graph Theorem of classical recursion theory states that a total function on the natural numbers is computable, if and only if its graph is recursive. It is known that this res...
103
Voted
CORR
1998
Springer
14 years 10 months ago
1998
Springer
In this paper we reexamine the place and role of stable model semantics in logic programming and contrast it with a least Herbrand model approach to Horn programs. We demonstrate ...
116
Voted
POPL
1992
ACM
15 years 2 months ago
1992
ACM
Semantics for a Higher-Order Functional Language with Logic Variables Radha Jagadeesan Imperial College, London, UK SW7 2BZ. Keshav Pingali Cornell University, Ithaca, NY 14853. A...