(Enter summary)
Abstract: This paper concerns the relation between parameterized first order data
types and first order logic. Augmenting first order logic by data type definitions
yields in general a strictly stronger logic than first order logic. We consider some
properties of the new logic for fixed data type definitions. While our new logic
always fulfills the downward Skolem-Lowenheim property, compactness is fulfilled
if and only if for the given data type definition the new logic has the same expressive... (Update)
Active bibliography (related documents): More All
4.8: First Order Data Types and First Order Logic - Treinen (1991)
(Correct)
0.7: Algebraic System Specification and Development.. - Cerioli, Gogolla, .. (1997)
(Correct)
0.3: Dynamic Logic - Harel, Kozen, Tiuryn (1984)
(Correct)
Similar documents based on text: More All
0.3: Feature Trees over Arbitrary Structures - Treinen (1997)
(Correct)
0.2: Ordering Constraints on Trees - Comon, Treinen (1994)
(Correct)
0.2: Equational and Membership Constraints for Infinite Trees - Niehren, Podelski, Treinen (1993)
(Correct)
BibTeX entry: (Update)
@inproceedings{ treinen91first,
author = "Ralf Treinen",
title = "First Order Data Types and First Order Logic",
booktitle = "Theoretical Aspects of Computer Software",
pages = "594-614",
year = "1991",
url = "citeseer.ist.psu.edu/treinen91first.html" }
Citations (may not include all citations):
484
Common LISP: The Language (context) - Steele - 1990
370
Mathematical Introduction to Logic (context) - Enderton - 1972
258
Miranda: a non-strict functional language with polymorphic t.. (context) - Turner - 1985 ACM DBLP
162
Programming in MODULA (context) - Wirth - 1985
160
Abstraction and Specification in Program Development (context) - Liskov, Guttag - 1986 ACM
143
Logics of programs (context) - Kozen, Tiuryn - 1990 ACM DBLP
79
CLU reference manual (context) - Liskov, Atkinson et al. - 1981
70
Equational problems and disunification (context) - Comon, Lescanne - 1989 ACM DBLP
59
An overview of Miranda (context) - Turner - 1986 ACM DBLP
37
Journal of Symbolic Computation (context) - Dershowitz, rewriting - 1987
35
a specification language (context) - Burstall, Goguen et al. - 1980 ACM DBLP
35
Modules for standard ML
- MacQueeen - 1986 ACM DBLP
20
Technical Report ECS-LFCS (context) - Harper, MacQueen et al. - 1986
20
Theory of Program Structures: Schemes (context) - Greibach - 1975
15
North-Holland Publishing Company (context) - Keisler, for et al. - 1971
15
North-Holland Publishing Company (context) - Chang, Keisler et al. - 1990
12
Correct and optimal implementations of recursion in a simple.. (context) - Vuillemin - 1974 ACM DBLP
12
On extension of elementary logic (context) - Lindstrom - 1969
11
An introduction to the construction and verification of Alph.. (context) - Wulf, London et al. - 1976 ACM DBLP
11
On hierarchies of abstract data types (context) - Wirsing, Pepper et al. - 1983 DBLP
10
Alphard: Form and Content (context) - Shaw - 1981
9
On formalized computer programs (context) - Luckham, Park et al. - 1970
7
On multi-head finite automata (context) - Rosenberg - 1963 DBLP
5
The Foundations of Program Verification (context) - Loeckx, Sieber - 1987 ACM
5
Complete axiomatisations of the algebra of finite (context) - Maher - 1988
5
Graduate Texts in Mathematics (context) - Monk, Logic - 1976
5
Algorithmic specifications: a constructive specification met.. (context) - Loeckx - 1987 ACM DBLP
4
A survey of the logic of effective definitions (context) - Tiuryn - 1981 ACM DBLP
4
The specification language of OBSCURE (context) - Lehmann, Loeckx - 1987 ACM DBLP
4
Lecture Notes in Computer Science (context) - Guessarian - 1979
3
EATCSMonographs on Theoretical Computer Science (context) - Ehrig, Mahr et al. - 1990
3
A Specification Language for Abstract Data Types (context) - Lehmann, Loeckx - 1990
2
First order logic applied to first order data types (context) - Treinen - 1991
2
Data Abstraction in Programming Languages (context) - Bishop - 1986 ACM
2
Disunifikation in modularen Termalgebren (context) - Buhmann - 1991
1
on Theoretical Computer Science (context) - Departement, Defense et al. - 1985
Documents on the same site (http://www.ps.uni-sb.de/Papers/abstracts/): More
Set-Based Failure Analysis for Logic Programs and.. - Podelski, Charatonik, .. (1999)
(Correct)
Type Inference for First-Class Messages with Feature Constraints - Müller, Nishimura
(Correct)
Entailment of Non-Structural Subtype Constraints - Niehren, Priesnitz (1999)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC