Sciweavers

1989 search results - page 46 / 398
» Set functions for functional logic programming
Sort
View
TPHOL
2003
IEEE
14 years 3 months ago
Applications of Polytypism in Theorem Proving
Abstract. Polytypic functions have mainly been studied in the context of functional programming languages. In that setting, applications of polytypism include elegant treatments of...
Konrad Slind, Joe Hurd
CADE
2008
Springer
14 years 10 months ago
Proving Bounds on Real-Valued Functions with Computations
Interval-based methods are commonly used for computing numerical bounds on expressions and proving inequalities on real numbers. Yet they are hardly used in proof assistants, as th...
Guillaume Melquiond
JCT
2000
103views more  JCT 2000»
13 years 10 months ago
A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time
We give a strongly polynomial-time algorithm minimizing a submodular function f given by a value-giving oracle. The algorithm does not use the ellipsoid method or any other linear ...
Alexander Schrijver
TYPES
2000
Springer
14 years 1 months ago
Executing Higher Order Logic
We report on the design of a prototyping component for the theorem prover Isabelle/HOL. Specifications consisting of datatypes, recursive functions and inductive definitions are co...
Stefan Berghofer, Tobias Nipkow
ISMVL
2008
IEEE
122views Hardware» more  ISMVL 2008»
14 years 4 months ago
RevLib: An Online Resource for Reversible Functions and Reversible Circuits
Synthesis of reversible logic has become an active research area in the last years. But many proposed algorithms are evaluated with a small set of benchmarks only. Furthermore, re...
Robert Wille, Daniel Große, Lisa Teuber, Ger...