Martin Wehr's Work Archive

Archive of Papers - Martin Wehr



Type Theory

.

Overloading Type Systems


A Second Look at Overloading
Abstract Martin Odersky, Philip Wadler and Martin Wehr.
BibTeX presented at FPCA'95.

Proof of the Principal Type Property for System O
Abstract Martin Wehr and Martin Odersky.
BibTeX Technical Report 1996-16 at University of Karlsruhe.

Überladung in Typsystemen
Abstract Martin Wehr
BibTeX Dissertation at University of Karlsruhe Oktober 1997.

Higher Dimensional Algebraic Data Types


Higher Dimensional Algebraic Data Types
Abstract Martin Wehr
An extended abstract was submitted to POPL'98
Higher Dimensional Syntax
Abstract Martin Wehr
in proceedings CTCS `99
Non-uniform Recursion: The solution (minimal sorting for fold)
Abstract Martin Wehr
submitted to MFCS 2000
BibTeX

Constraint Type Systems


Type Inference with constrained Types
Abstract Martin Sulzmann, Martin Odersky, and Martin Wehr.
BibTeX submited to POPL '97.
Type Inference with constrained Types
Abstract Martin Sulzmann, Martin Odersky, and Martin Wehr.
to appear in Theory and Practice of Object Systems
An extended abstract appeared in Proc. 4th Int. Workshop on Foundations of Object-Oriented Languages
BibTeX
Back to the top of this page or my home page.

Quantum Computing

Quantum Computing: A new Paradigm and it's Type Theory
Abstract Martin Wehr
BibTeX talk held at the quantum computing seminar, Lehrstuhl Prof. Beth, Universität Karlsruhe . llniversität
Back to the top of this page or my home page.

Notes

Higher Order Recursion
Abstract Martin Wehr
This paper contains several characterisations of algebraic data types. Which are categorical, encoding in System F, combinatorical, related to contextfree languages and encoded in Martin Löf type theory
A categorical model for HM(X)
Abstract Martin Wehr
The axiomatisation of type inference with constraints (system HM(X)) poses the question of the underlying conceptual basis. This paper is an attempt for a categorical characterisation of type inference. In a next step the characterisation of constraint type inference is tackled.
Club polymorphism
Abstract Martin Wehr
This note is a characterisation of two-dimensional schematic polymorphic free Lawere theories. Algebraic data types are an instance of this mathematical structure.
Located Pi-Calculus
Abstract Martin Wehr
A location notion is introduced into pi-caluculus to achieve a characterisation of distributed computing.
Back to the top of this page or my home page.
Maintained by Martin Wehr.
Last updated: 11 Mar. 99.
Top of page.