1194 search results - page 113 / 239 » A Calculus for Predicative Programming |
135
click to vote
ICML
1994
IEEE
15 years 8 months ago
1994
IEEE
This paper describes a new methodfor inducing logic programs from examples which attempts to integrate the best aspects of existingILP methodsintoa singlecoherent framework. In pa...
127
click to vote
JLP
2000
15 years 4 months ago
2000
interpretation. In the context of stream parallelism, this analysis identi es an amount of input data for which predicate execution can safely wait without danger of introducing de...
137
click to vote
CADE
2001
Springer
16 years 5 months ago
2001
Springer
In this paper, we present a syntax-directed termination and reduction checker for higher-order logic programs. The reduction checker verifies parametric higher-order subterm orderi...
125
click to vote
COLING
1992
15 years 6 months ago
1992
Parsing a long sentence is very difficult, since long sentences often have conjunctions which result in ambiguities. If the conjunctive structures existing in a long sentence can ...
219
click to vote
POPL
2009
ACM
16 years 5 months ago
2009
ACM
Abstract Types in Modules with Open Existential Types Beno?t Montagu Didier R?my INRIA {Benoit.Montagu, Didier.Remy}@inria.fr We propose F , a calculus of open existential types t...