Reproduction of all or part of this work is permitted for educational or research use on condition that this copyright notice is included in any copy. See back inner page for a list of recent publications in the BRICS Report Series. Copies may be obtained by contacting: BRICS
|
464
|
Introduction to HOL: A Theorem Proving Environment for Higher-Order Logic,” Cambridge
– Gordon, Melham
- 1993
|
|
356
|
Isabelle: A Generic Theorem Prover
– Paulson
- 1994
|
|
237
|
Orderings for term rewriting systems
– Dershowitz
- 1982
|
|
231
|
Combinatory reduction systems
– Klop
- 1980
|
|
198
|
Order-sorted algebra I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations
– Goguen, Meseguer
- 1992
|
|
170
|
Understanding Z - A Specification Language and its Formal Semantics. Cambridge Tracts in Computer Science 3
– Spivey
- 1988
|
|
165
|
Data Types as Lattices
– Scott
- 1976
|
|
135
|
Completeness in the theory of types
– Henkin
- 1950
|
|
124
|
Dynamic Typing in a Statically Typed Language
– Abadi, Cardelli, et al.
- 1991
|
|
115
|
Higher-order critical pairs
– Nipkow
- 1991
|
|
72
|
Temporal logic
– Benthem
- 1995
|
|
70
|
Basic Paramodulation and Superposition
– Bachmair, Ganzinger, et al.
- 1992
|
|
70
|
Coherence of subsumption, minimum typing and typechecking
– Curien, Ghelli
- 1992
|
|
53
|
Unified algebras and institutions
– Mosses
- 1989
|
|
53
|
1992], Theorem proving with ordering constrained clauses, in `Automated Deduction -- CADE'11
– Nieuwenhuis, Rubio
|
|
50
|
Basic superposition is complete
– Nieuwenhuis, Rubio
- 1992
|
|
48
|
Two generalizations of the recursive path ordering. Unpublished note
– Kamin, Levy
- 1980
|
|
47
|
Order-sorted equational computation
– Smolka, Nutt, et al.
- 1989
|
|
39
|
M.: A rationale for conditional equational programming
– Dershowitz, Okada
- 1990
|
|
38
|
Sheaves and logic
– Fourman, Scott
- 1979
|
|
27
|
Universal algebra in higher types
– Meinke
- 1992
|
|
26
|
Operational Semantics of OBJ3
– Kirchner, Kirchner, et al.
- 1988
|
|
18
|
Untersuchungen zur mehrsortigen Quantorenlogik
– Oberschelp
- 1962
|
|
15
|
Saturation of First-Order (Constrained) Clauses with the Saturate System
– Nivela, Nieuwenhuis
- 1993
|
|
12
|
Dynamically-typed computations for order-sorted equational presentations
– Hintermeier, Kirchner, et al.
- 1994
|
|
11
|
Equational type logic
– Manca, Salibra, et al.
- 1990
|
|
9
|
Algebraic Specifications of Reachable Higher-Order Algebras
– Moller, Tarlecki, et al.
- 1988
|
|
8
|
Mathematical logic and Hilbert's ffl-symbol
– Leisenring
- 1969
|
|
5
|
Sort inheritance for order-sorted equational presentations
– Hintermeier, Kirchner, et al.
- 1995
|
|
5
|
Higher order data types
– Maibaum, Lucena
- 1980
|
|
5
|
Partial algebras, subsorting and dependent types. prerequisites of error handling in algebraic specifications
– Poign'e
- 1987
|
|
3
|
Grundlagen der Mathematik, volume 2
– Hilbert, Bernays
- 1944
|
|
3
|
Alg`ebre galactique --- Un proc'ed'e de calcul formel, relatif aux semifonctions, `a l'inclusion et `a l"egalit'e. Th`ese de Doctorat d'Universit'e, Universit'e Henri Poincar'e -- Nancy 1
– M'egrelis
- 1990
|
|
3
|
Principia Mathematica, volume 1
– Whitehead, Russell
- 1925
|
|
2
|
D'eduction avec sortes ordonn'ees et 'egalit'es. Th`ese de Doctorat d'Universit'e, Universit'e Henri Poincar'e -- Nancy 1
– Hintermeier
- 1995
|
|
2
|
Algebraic specifications with high-order operators
– Moller
- 1987
|
|
2
|
Algebraic specification with built-in domain constructions
– Moller, Tarlecki, et al.
- 1988
|
