Sciweavers

385 search results - page 55 / 77
» Extensionality in the Calculus of Constructions
Sort
View
ECOOP
2000
Springer
15 years 2 months ago
A Basic Model of Typed Components
This paper studies specific language level abstractions for component-based programming. We propose a simple model which captures some basic ingredients — like explicit context ...
João Costa Seco, Luís Caires
76
Voted
POPL
1998
ACM
15 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
84
Voted
TABLEAUX
1998
Springer
15 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
15 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
15 years 1 months 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