128 search results - page 9 / 26 » Verifying Process Algebra Proofs in Type Theory |
164
Voted
ICFP
2010
ACM
15 years 4 months ago
2010
ACM
Modern proof assistants such as Coq and Isabelle provide high degrees of expressiveness and assurance because they support formal reasoning in higher-order logic and supply explic...
164
Voted
PLPV
2009
ACM
16 years 15 days ago
2009
ACM
We propose a new way to reason about general recursive functional programs in the dependently typed programming language Agda, which is based on Martin-L¨of’s intuitionistic ty...
241
Voted
POPL
2003
ACM
16 years 3 months ago
2003
ACM
We introduce a new framework of algebraic pure type systems in which we consider rewrite rules as lambda terms with patterns and rewrite rule application as abstraction applicatio...
168
Voted
CADE
1992
Springer
15 years 7 months ago
1992
Springer
Abstract. We exhibit a methodology for formulating and verifying metatheorems about deductive systems in the Elf language, an implementation of the LF Logical Framework with an ope...
139
Voted
CADE
2004
Springer
16 years 3 months ago
2004
Springer
Abstract. Classifying finite algebraic structures has been a major motivation behind much research in pure mathematics. Automated techniques have aided in this process, but this ha...