4370 search results - page 315 / 874 » Algebra of Logic Programming |
116
Voted
ENTCS
2006
15 years 24 days ago
2006
We develop a domain theory for treating recursive types with respect to contextual equivalence. The principal approach taken here deviates from classical domain theory in that we ...
174
Voted
BANFF
1995
15 years 4 months ago
1995
The automata-theoretic approach to linear temporal logic uses the theory of automata as a unifying paradigm for program specification, verification, and synthesis. Both programs ...
111
Voted
ICLP
2003
Springer
15 years 6 months ago
2003
Springer
Abstract. In this paper we show how we can use size and groundness analyses lifted to regular and (polymorphic) Hindley/Milner typed programs to determine more accurate termination...
WSC
2000
15 years 2 months ago
2000
Input modeling that involves fitting standard univariate parametric probability distributions is typically performed using an input modeling package. These packages typically fit ...
205
Voted
ICFP
2009
ACM
16 years 1 months ago
2009
ACM
We define logical relations between the denotational semantics of a simply typed functional language with recursion and the operational behaviour of low-level programs in a varian...