139 search results - page 14 / 28 » Specialization of Inductively Sequential Functional Logic Pr... |
126
Voted
JAR
2010
15 years 1 months ago
2010
Abstract. In this paper we propose an effective procedure for translating a proof term of the Calculus of Inductive Constructions (CIC), which is very similar to a program written...
132
click to vote
CIE
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. We study a realisability interpretation for inductive and coinductive definitions and discuss its application to program extraction from proofs. A speciality of this inte...
139
Voted
TCS
2011
14 years 10 months ago
2011
New, simple, proofs of soundness (every representable function lies in a given complexity class) for Elementary Affine Logic, LFPL and Soft Affine Logic are presented. The proofs ...
226
click to vote
Book
This is an introductory book about machine learning. Notice that this is a draft book. It may contain typos, mistakes, etc.
The book covers the following topics: Boolean Functio...
125
Voted
ICLP
2007
Springer
15 years 7 months ago
2007
Springer
We present a static analysis that infers both upper and lower bounds on the usage that a logic program makes of a set of user-definable resources. The inferred bounds will in gener...