Sciweavers

10715 search results - page 383 / 2143
» Proofs from Tests
Sort
View
ALP
1992
Springer
15 years 11 months ago
On the Relation Between Primitive Recursion, Schematization and Divergence
The paper presents a new schematization of in nite families of terms called the primal grammars, based on the notion of primitive recursive rewrite systems. This schematization is...
Miki Hermann
STOC
1989
ACM
99views Algorithms» more  STOC 1989»
15 years 11 months ago
A Random Polynomial Time Algorithm for Approximating the Volume of Convex Bodies
We present a randomised polynomial time algorithm for approximating the volume of a convex body K in n-dimensional Euclidean space. The proof of correctness of the algorithm relie...
Martin E. Dyer, Alan M. Frieze, Ravi Kannan
HOA
1995
15 years 10 months ago
Third-Order Matching in the Polymorphic Lambda Calculus
We show that it is decidable whether a third-order matching problem in the polymorphic lambda calculus has a solution. The proof is constructive in the sense that an algorithm can...
Jan Springintveld
TAPSOFT
1987
Springer
15 years 10 months ago
Induction Principles Formalized in the Calculus of Constructions
The Calculus of Constructions is a higher-order formalism for writing constructive proofs in a natural deduction style, inspired from work of de Bruijn [2, 3], Girard [12], Martin...
Gérard P. Huet
FLAIRS
2000
15 years 8 months ago
Formal Software Development in the Verification Support Environment (VSE)
The paper presents a survey of the VSE system, a kind of CASE-tool for formal software development. It is a summary of a tutorial presentation describing methodology, formalisms, ...
Dieter Hutter, Georg Rock, Jörg H. Siekmann, ...