Sciweavers

28 search results - page 5 / 6
» Higher Order Quotients and their Implementation in Isabelle ...
Sort
View
JAPLL
2006
87views more  JAPLL 2006»
13 years 5 months ago
Is ZF a hack?: Comparing the complexity of some (formalist interpretations of) foundational systems for mathematics
This paper presents Automath encodings (which also are valid in LF/P) of various kinds of foundations of mathematics. Then it compares these encodings according to their size, to f...
Freek Wiedijk
FMCAD
2006
Springer
13 years 9 months ago
Formal Analysis and Verification of an OFDM Modem Design using HOL
In this paper we formally specify and verify an implementation of the IEEE802.11a standard physical layer based OFDM (Orthogonal Frequency Division Multiplexing) modem using the HO...
Abu Nasser Mohammed Abdullah, Behzad Akbarpour, So...
JAR
2008
105views more  JAR 2008»
13 years 5 months ago
Proof Synthesis and Reflection for Linear Arithmetic
This article presents detailed implementations of quantifier elimination for both integer and real linear arithmetic for theorem provers. The underlying algorithms are those by Coo...
Amine Chaieb, Tobias Nipkow
TPHOL
2002
IEEE
13 years 10 months ago
Free-Style Theorem Proving
g Higher Order Abstract Syntax with Tactical Theorem Proving and (Co)Induction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13 ...
David Delahaye
CADE
2006
Springer
14 years 6 months ago
Extracting Programs from Constructive HOL Proofs Via IZF Set-Theoretic Semantics
Church's Higher Order Logic is a basis for proof assistants -- HOL and PVS. Church's logic has a simple set-theoretic semantics, making it trustworthy and extensible. We ...
Robert L. Constable, Wojciech Moczydlowski