Sciweavers

2585 search results - page 393 / 517
» Automating Coherent Logic
Sort
View
KBSE
2005
IEEE
16 years 1 days ago
Prufrock: a framework for constructing polytypic theorem provers
Current formal software engineering methodologies provide a vast array of languages for specifying correctness properties, as well as a wide assortment automated tools that aid in...
Justin Ward, Garrin Kimmell, Perry Alexander
ICFP
2009
ACM
16 years 7 months ago
Effective interactive proofs for higher-order imperative programs
We present a new approach for constructing and verifying higherorder, imperative programs using the Coq proof assistant. We build on the past work on the Ynot system, which is bas...
Adam J. Chlipala, J. Gregory Malecha, Greg Morrise...
ICDE
2009
IEEE
195views Database» more  ICDE 2009»
16 years 1 months ago
The PRISM Workwench: Database Schema Evolution without Tears
— Information Systems are subject to a perpetual evolution, which is particularly pressing in Web Information Systems, due to their distributed and often collaborative nature. Su...
Carlo Curino, Hyun J. Moon, MyungWon Ham, Carlo Za...
TPHOL
2005
IEEE
16 years 1 days ago
A Structured Set of Higher-Order Problems
Abstract. We present a set of problems that may support the development of calculi and theorem provers for classical higher-order logic. We propose to employ these test problems as...
Christoph Benzmüller, Chad E. Brown
LACL
2001
Springer
15 years 11 months ago
Structural Equations in Language Learning
In categorial systems with a fixed structural component, the learning problem comes down to finding the solution for a set of typeassignment equations. A hard-wired structural co...
Michael Moortgat