Sciweavers

34 search results - page 4 / 7
» Classical Program Extraction in the Calculus of Construction...
Sort
View
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
FLOPS
2004
Springer
15 years 3 months ago
Semantics of Linear Continuation-Passing in Call-by-Name
We propose a semantic framework for modelling the linear usage of continuations in typed call-by-name programming languages. On the semantic side, we introduce a construction for c...
Masahito Hasegawa
ICFP
1997
ACM
15 years 1 months ago
Foundations for the Implementation of Higher-Order Subtyping
We show how to implement a calculus with higher-order subtyping and subkinding by replacing uses of implicit subsumption with explicit coercions. To ensure this can be done, a pol...
Karl Crary
EMSOFT
2005
Springer
15 years 3 months ago
Synchronization of periodic clocks
We propose a programming model dedicated to real-time videostreaming applications for embedded media devices, including highdefinition TVs. This model is built on the synchronous...
Albert Cohen, Marc Duranton, Christine Eisenbeis, ...
62
Voted
APAL
2005
107views more  APAL 2005»
14 years 9 months ago
Uniform Heyting arithmetic
We present an extension of Heyting Arithmetic in finite types called Uniform Heyting Arithmetic (HAu) that allows for the extraction of optimized programs from constructive and cla...
Ulrich Berger