论文信息 - Implementation of the Veritas Design Logic

Implementation of the Veritas Design Logic

Veritas is a design logic that provides dependent types and subtypes. It is implemented within the functional programming language Haskell. Interesting aspects of this implementation , in particular those relating to dependent types, to the representation of terms and signatures, to syntactic variants (controlled by attributes) and to a concrete notation for derivations are discussed.

W. Gareth J. Howells | Keith Hanna | Neil Daeche

[1] Joseph A. Goguen,et al. Putting Theories Together to Make Specifications , 1977, IJCAI.

[2] Mark Longley,et al. Formal Synthesis of Digital Systems , 1989 .

[3] Keith Hanna,et al. Purely Functional Implementation of a Logic , 1986, CADE.

[4] Rance Cleaveland,et al. Implementing mathematics with the Nuprl proof development system , 1986 .

[5] Simon L. Peyton Jones,et al. Parallel Implementations of Functional Programming Languages , 1989, Comput. J..

[6] Geoffrey Brown,et al. Proceedings of the Mathematical Sciences Institute workshop on Hardware specification, verification and synthesis: mathematical aspects , 1989 .

[7] Mark Longley,et al. Veritas+: A Specification Language Based on Type Theory , 1989, Hardware Specification, Verification and Synthesis.