#### Filter Results:

- Full text PDF available (6)

#### Publication Year

1996

2008

#### Publication Type

#### Co-author

#### Publication Venue

#### 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 specific properties of HOL, this encoding turns out to be extremely simple. In particular , structural subtyping is subsumed by naive parametric polymor-phism, while overridable generic functions may be based on overloading.… (More)

- Wolfgang Naraschewski, Tobias Nipkow
- TYPES
- 1996

This paper presents the rst machine-checked veriication 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 types… (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)

- Wolfgang Naraschewski
- TPHOLs
- 1997

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

We show how extensible records with structural subtyping can be represented directly in Higher-Order Logic (HOL). Exploiting some speciic properties of HOL, this encoding turns out to be extremely simple. In particular , structural subtyping is subsumed by naive parametric polymor-phism, while overridable generic functions may be based on overloading.… (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 widespread theorem provers as e.g. Isabelle/HOL.

- ‹
- 1
- ›