Sciweavers

660 search results - page 73 / 132
» The Implicit Calculus of Constructions
Sort
View
POPL
1998
ACM
14 years 1 months ago
A Functional Representation of Data Structures with a Hole
Data structures with a hole, in other words data structures with an uninitialized field, are useful to write efficient programs: they enable us to construct functional data stru...
Yasuhiko Minamide
TABLEAUX
1998
Springer
14 years 1 months ago
Fibring Semantic Tableaux
The methodology of fibring is a successful framework for combining logical systems based on combining their semantics. In this paper, we extend the fibring approach to calculi for ...
Bernhard Beckert, Dov M. Gabbay
KBSE
1997
IEEE
14 years 1 months ago
Moving Proofs-As-Programs into Practice
Proofs in the Nuprl system, an implementation of a constructive type theory, yield “correct-by-construction” programs. In this paper a new methodology is presented for extract...
James L. Caldwell
TAPSOFT
1993
Springer
14 years 29 days ago
Optimal Reductions in Interaction Systems
Lamping's optimalgraph reduction technique for the -calculus is generalized to a new class of higher order rewriting systems, called Interaction Systems. Interaction Systems ...
Andrea Asperti, Cosimo Laneve
APSEC
2004
IEEE
14 years 20 days ago
Extending a Graphic Modeling Language to Support Partial and Evolutionary Specification
The notion of partial and evolutionary specification has gained attention both in research and industry in the last years. While many people regard this just as a process issue, w...
Yong Xia, Martin Glinz