R. Burstall. Extended Calculus of Constructions as a specification language. In R. Bird and C. Morgan, editors, Mathematics of Program Construction, 1993. Invited talk.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....(and inductive families, not covered above) and predicative type universes. It has nice meta theoretic properties such as ChurchRosser, Subject Reduction, and Strong Normalisation [21] Implemented in the Lego proof development system, UTT has been applied to verification of functional programs [10, 11], imperative programs [42] and concurrent programs [44] specification and data refinement [29] and formalisation of mathematics [40] 2.3 Definitional equality and computational equality We use LF seriously as a meta level language (see Section 9.1.2 of [30] for a discussion) Along the same ....

R. Burstall. Extended Calculus of Constructions as a specification language. In R. Bird and C. Morgan, editors, Mathematics of Program Construction, 1993. Invited talk.

....families, not covered above) and predicative type universes. UTT has nice meta theoretic properties such as Church Rosser, Subject Reduction, and Strong Normalisation [Gog94] Implemented in the Lego proof development system, UTT has been applied to program specification and verification (eg, Bur93, BM92] data refinement [Luo93] and formalisation of mathematics [Pol94] 2.3 Definitional equality and computational equality We use LF seriously as a meta level language (see Section 9.1.2 of [Luo94] for a discussion) Along the same line, we make a distinction between the notion of ....

R. Burstall. Extended Calculus of Constructions as a specification language. In R. Bird and C. Morgan, editors, Mathematics of Program Construction, 1993. Invited talk.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC