4757 search results - page 35 / 952 » Monads for Functional Programming |
129
click to vote
TLCA
2007
Springer
15 years 8 months ago
2007
Springer
We describe a new method to represent (partial) recursive functions in type theory. For every recursive definition, we define a co-inductive type of prophecies that characterises...
114
click to vote
CORR
2004
Springer
15 years 2 months ago
2004
Springer
We show that the first-order theory of structural subtyping of non-recursive types is decidable. Let be a language consisting of function symbols (representing type constructors)...
111
click to vote
CAV
1999
Springer
15 years 6 months ago
1999
Springer
BDDs and their algorithms implement a decision procedure for Quanti ed Propositional Logic. BDDs are a kind of acyclic automata. Unrestricted automata (recognizing unbounded string...
123
click to vote
ICDT
1995
ACM
15 years 5 months ago
1995
ACM
Following results are sketched in this extended abstract: (1) Datalog recursive programs where each rule has at most one subgoal called unit recursions are shown to be bounded, wit...