Sciweavers

1989 search results - page 107 / 398
» Set functions for functional logic programming
Sort
View
ICFP
2012
ACM
12 years 1 months ago
Propositions as sessions
Continuing a line of work by Abramsky (1994), by Bellin and Scott (1994), and by Caires and Pfenning (2010), among others, this paper presents CP, a calculus in which propositions...
Philip Wadler
FPCA
1989
14 years 2 months ago
Theorems for Free!
Parametric polymorphism constrains the behavior of pure functional programs in a way that allows the derivation of interesting theorems about them solely from their types, i.e., v...
Philip Wadler
ACL2
2006
ACM
14 years 4 months ago
Adding parallelism capabilities to ACL2
We have implemented parallelism primitives that permit an ACL2 programmer to parallelize execution of ACL2 functions. We (1) introduce logical definitions for these primitives, (...
David L. Rager
ECML
2006
Springer
14 years 2 months ago
(Agnostic) PAC Learning Concepts in Higher-Order Logic
This paper studies the PAC and agnostic PAC learnability of some standard function classes in the learning in higher-order logic setting introduced by Lloyd et al. In particular, i...
Kee Siong Ng
CORR
2000
Springer
103views Education» more  CORR 2000»
13 years 10 months ago
Automatic Termination Analysis of Programs Containing Arithmetic Predicates
For logic programs with arithmetic predicates, showing termination is not easy, since the usual order for the integers is not well-founded. A new method, easily incorporated in th...
Nachum Dershowitz, Naomi Lindenstrauss, Yehoshua S...