1989 search results - page 129 / 398 » Set functions for functional logic programming |
AMAST
1998
Springer
15 years 2 months ago
1998
Springer
Abstract. We propose a general categorical setting for modeling program composition in which the call-by-value and call-by-name disciplines fit as special cases. Other notions of c...
UAI
2008
14 years 11 months ago
2008
Approximate linear programming (ALP) is an efficient approach to solving large factored Markov decision processes (MDPs). The main idea of the method is to approximate the optimal...
ICSE
1997
IEEE-ACM
15 years 2 months ago
1997
IEEE-ACM
By determining, statically, where the structure of a program requires sets of variables to share a common tation, we can identify abstract data types, detect ion violations, find ...
TLDI
2005
ACM
15 years 3 months ago
2005
ACM
Two different ways of defining ad-hoc polymorphic operations commonly occur in programming languages. With the first form polymorphic operations are defined inductively on the...
CORR
2004
Springer
14 years 9 months ago
2004
Springer
We present a polymorphic type system for lambda calculus ensuring that welltyped programs can be executed in polynomial time: dual light affine logic (DLAL). DLAL has a simple typ...