Sciweavers

3738 search results - page 76 / 748
» Parametrized Logic Programming
Sort
View
123
Voted
ICFP
2006
ACM
16 years 3 months ago
Polymorphism and separation in hoare type theory
In previous work, we proposed a Hoare Type Theory (HTT) which combines effectful higher-order functions, dependent types and Hoare Logic specifications into a unified framework. H...
Aleksandar Nanevski, Greg Morrisett, Lars Birkedal
123
Voted
TABLEAUX
1997
Springer
15 years 7 months ago
ileanTAP: An Intuitionistic Theorem Prover
We present a Prolog program that implements a sound and complete theorem prover for first-order intuitionistic logic. It is based on free-variable semantic tableaux extended by an...
Jens Otten
161
Voted
LISP
2008
165views more  LISP 2008»
15 years 3 months ago
Adapting functional programs to higher order logic
Higher-order logic proof systems combine functional programming with logic, providing functional programmers with a comfortable setting for the formalization of programs, specifica...
Scott Owens, Konrad Slind
135
Voted
INFORMS
1998
100views more  INFORMS 1998»
15 years 3 months ago
Feature Selection via Mathematical Programming
The problem of discriminating between two nite point sets in n-dimensional feature space by a separating plane that utilizes as few of the features as possible, is formulated as a...
Paul S. Bradley, Olvi L. Mangasarian, W. Nick Stre...
127
Voted
TPHOL
2007
IEEE
15 years 9 months ago
Proof Pearl: The Power of Higher-Order Encodings in the Logical Framework LF
Abstract. In this proof pearl, we demonstrate the power of higherorder encodings in the logical framework Twelf[PS99] by investigating proofs about an algorithmic specification of...
Brigitte Pientka