Sciweavers

3624 search results - page 553 / 725
» Abstract Algebraic Logic
Sort
View
CADE
2006
Springer
16 years 6 months ago
Combining Type Theory and Untyped Set Theory
Abstract. We describe a second-order type theory with proof irrelevance. Within this framework, we give a representation of a form of Mac Lane set theory and discuss automated supp...
Chad E. Brown
CADE
2006
Springer
16 years 6 months ago
Automation of Recursive Path Ordering for Infinite Labelled Rewrite Systems
Abstract. Semantic labelling is a transformational technique for proving termination of Term Rewriting Systems (TRSs). Only its variant with finite sets of labels was used so far i...
Adam Koprowski, Hans Zantema
CADE
2004
Springer
16 years 6 months ago
Using Automated Theorem Provers to Certify Auto-generated Aerospace Software
Abstract. We describe a system for the automated certification of safety properties of NASA software. The system uses Hoare-style program verification technology to generate proof ...
Bernd Fischer 0002, Ewen Denney, Johann Schumann
ICFP
2003
ACM
16 years 6 months ago
An extension of HM(X) with bounded existential and universal data-types
We propose a conservative extension of HM(X), a generic constraint-based type inference framework, with bounded existential (a.k.a. abstract) and universal (a.k.a. polymorphic) da...
Vincent Simonet
ICFP
2003
ACM
16 years 6 months ago
Mechanising Hankin and Barendregt using the Gordon-Melham axioms
I describe the mechanisation in HOL of some basic -calculus theory, using the axioms proposed by Gordon and Melham [4]. Using these as a foundation, I mechanised the proofs from C...
Michael Norrish