850 search results - page 91 / 170 » A Logic Programming Language Based on Binding Algebras |
120
click to vote
ICFP
2005
ACM
16 years 1 months ago
2005
ACM
We explore partial type-inference for System F based on type-containment. We consider both cases of a purely functional semantics and a call-by-value stateful semantics. To enable...
100
click to vote
CAISE
1999
Springer
15 years 5 months ago
1999
Springer
In this paper, we describe the process specification language ConGolog and show how it can be used to model business processes for requirements analysis. In ConGolog, the effects...
103
click to vote
ECOOP
1999
Springer
15 years 5 months ago
1999
Springer
Abstract. Automatic program specialization can derive efficient implementations from generic components, thus reconciling the often opposing goals of genericity and efficiency. Thi...
104
click to vote
JFP
2008
15 years 1 months ago
2008
Most programming languages adopt static binding, but for distributed programming an exclusive reliance on static binding is too restrictive: dynamic binding is required in various...
104
click to vote
PPDP
2001
Springer
15 years 5 months ago
2001
Springer
We define a transformation from a left-linear constructor-based conditional rewrite system into an overlapping inductively sequential rewrite system. This transformation is sound...