#### Filter Results:

- Full text PDF available (4)

#### Publication Year

1996

2004

- This year (0)
- Last 5 years (0)
- Last 10 years (0)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Wolfgang Naraschewski, Markus Wenzel
- TPHOLs
- 1998

We show how extensible records with structural subtyping can be represented directly in Higher-Order Logic (HOL). Exploiting some speci c properties of HOL, this encoding turns out to be extremely simple. In particular, structural subtyping is subsumed by naive parametric polymorphism, while overridable generic functions may be based on overloading. Taking… (More)

- Wolfgang Naraschewski, Tobias Nipkow
- Journal of Automated Reasoning
- 1996

This paper presents the first machine-checked verification of Milner's type inference algorithm W for computing the most general type of an untyped λ-term enriched with let-expressions. This term language is the core of most typed functional programming languages and is also known as Mini-ML. We show how to model all the concepts involved, in particular… (More)

- Wolfgang Naraschewski
- TPHOLs
- 1997

To support formal verification of object-oriented programs we have proposed elsewhere an encoding in the type-theoretic proofchecker Lego. By treating programs and proofs uniformly, the encoding provides object-oriented proving principles including inheritance of proofs as analogues to object-oriented programming principles. Though the encoding is suitable… (More)

The Curry-Howard isomorphism, a fundamental property shared by many type theories, establishes a direct correspondence between programs and proofs. This suggests that the same structuring principles that ease programming be used to simplify proving as well. To exploit object-oriented structuring mechanisms for veriication, we extend the object-model of… (More)

We present a generic framework called LOGOS that may serve as a formal basis for investigations of authorization issues in groupware systems. LOGOS has been formulized within HOL a well-known higher-order logic, which is supported by a number of wide-spread theorem provers as e.g. Isabelle/HOL.

- Wolfgang Naraschewski, Tobias Nipkow
- Archive of Formal Proofs
- 2004

- ‹
- 1
- ›