43 search results - page 8 / 9 » Constructing Induction Rules for Deductive Synthesis Proofs |
PLPV
2009
ACM
14 years 1 months 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...
SAS
1993
Springer
13 years 8 months ago
1993
Springer
A new construction of a finite set of strictness properties for any lazy algebraic datatype is presented. The construction is based on the categorical view of the solutions to the...
BIRTHDAY
2006
Springer
13 years 8 months ago
2006
Springer
The COL institution (constructor-based observational logic) has been introduced as a formal framework to specify both generationand observation-oriented properties of software syst...
TLCA
1997
Springer
13 years 9 months ago
1997
Springer
We present new sound and complete axiomatizations of type equality and subtype inequality for a first-order type language with regular recursive types. The rules are motivated by ...
MCMASTER
1993
13 years 8 months ago
1993
Abstract. This survey of the theory and applications of rewriting with equations discusses the existence and uniqueness of normal forms, the Knuth-Bendix completion procedure and i...