- Partial Recursive Functions in MartinLof Type Anton Setzer #
- Integrating Functional Programming Into C++:Implementation and Verification
- 276 LOGIC COLLOQUIUM '96 d.c.e. degrees. Arslanov, Lempp and Shore [1] proved the existence of non-isolating c.e. de-
- Interactive Programs in Dependent Type Theory Peter Hancock 1 and Anton Setzer 2
- Proof Theory and MartinLof Type Anton Setzer
- Indexed InductionRecursion Peter Dybjer # and Anton Setzer +
- ObjectOriented Programming in Dependent Type Theory Anton Setzer #
- Set theoretical proofs as type theoretical Anton Setzer
- EXACT DICKSON ORDINALS MARKUS MICHELBRINK, ANTON SETZER
- A Provably Correct Translation of the #Calculus into a Mathematical Model of C++
- Good GUI Design Anton Setzer
- Ordinal Systems Anton Setzer \Lambda
- Functional Concepts in C++ Rose H. Abdul Rauf, Ulrich Berger, Anton Setzer #
- Inductive Definitions with Decidable Atomic Anton Setzer ?
- Universes in Type Theory Part I --Inaccessibles and Mahlo
- Translating Set Theoretical Proofs into Type Theoretical Programs
- Rules for the \Pi 3 reflecting Universe Anton Setzer \Lambda
- Weak Bisimulation Approximants Will Harwood, Faron Moller, and Anton Setzer
- Interactive Programs and Weakly Final Coalgebras in Dependent Type Theory
- Universes in Type Theory Part II --Autonomous Mahlo
- An extended predicative definition of the Mahlo Reinhard Kahle Anton Setzer
- 260 LOGIC COLLOQUIUM '94 ANTON SETZER, Proof theoretical strength of Martin-Lof type theory.
- Inductive-inductive Definitions Fredrik Nordvall Forsberg
- Automated Verification of Signalling Principles in Railway Interlockings1
- A Provably Correct Translation of the -Calculus into a Mathematical Model of C++
- State Dependent IO-Monads in Type Theory Markus Michelbrink
- Interactive Programs and Weakly Final Coalgebras in Dependent Type Theory
- Induction-Recursion and Initial Algebras
- Indexed Induction-Recursion Peter Dybjer
- Well-ordering proofs for Martin-Lof Type Anton Setzer
- Electronic Communications of the EASST Volume X (2010)
- Object-Oriented Programming in Dependent Type Theory Anton Setzer
- Functional Concepts in C++ Rose H. Abdul Rauf, Ulrich Berger, Anton Setzer
- Universes in Type Theory Part II Autonomous Mahlo and 3-Reflection
- Interactive Programs and Weakly Final Coalgebras in Dependent Type Theory
- ANTON SETZER, Weakly final coalgebras in Martin-Lof type theory. Dept. of Computer Science, Swansea University, Singleton Park Swansea SA2 8PP,
- 128 LOGIC COLLOQUIUM '95 Crossley, editor), Lecture Notes in Mathematics, vol. 450, Springer-Verlag, Berlin, 1975, pp.
- Anton Setzer December 7, 1997
- A Model for a type theory with Mahlo Universe
- , Constructive Reals and Lecture notes of the second half of a course on constructive mathematics and
- UNIVERSITY OF WALES SWANSEA REPORT SERIES
- Integrating Functional Programming Into C++:Implementation and Verification
- Proof Theory meets Type Theory Swansea, UK, 15 -16 March 2008
- Surfing on the Gower 111111 G500
- Surfing on the Gower 111111 G500
- Introduction to LATEX Harvey Gould (136499)
- Good Java Programming Styles Anton Setzer
- Text-Editing and Programming
- Logical Methods in Computer Science Vol. 4 (1:9) 2008, pp. 136
- Good SQL Programming Styles Anton Setzer
- Automated Verification of Safety Properties in Railway Interlocking Systems Defined with
- Getting started with LATEX November 1, 2004
- ObjectOriented Programming in Dependent
- Universes in Type Theory Part I Inaccessibles and Mahlo
- Corrections to my article ``Ordinal Systems'' Anton Setzer \Lambda
- Automated Verification of Safety Properties in Railway Interlocking Systems Defined with
- Java as a Functional Programming Language Anton Setzer #
- Interactive Programs in Dependent Type Theory
- Proof Theory of Martin-Lof Type Theory An Anton Setzer
- A Categorical Semantics for Inductive-Inductive Definitions
- Under consideration for publication in Math. Struct. in Comp. Science A Light-Weight Integration of Automated
- Universes in Type Theory Part II --Autonomous Mahlo and # 3 Reflection
- Weak Bisimulation Approximants Will Harwood, Faron Moller, and Anton Setzer #
- Coalgebras as Types determined by their Elimination Rules
- Object-Oriented Programming in Dependent
- InductionRecursion and Initial Algebras
- Coalgebras as Types determined by their Elimination Rules
- Interactive Programs in Dependent Type Theory Peter Hancock 1 and Anton Setzer 2
- An upper bound for the proof theoretical strength of MartinLof Type Theory
- Wellordering proofs for MartinLof Type Anton Setzer
- Java as a Functional Programming Language Anton Setzer
- A BUCHOLZ DERIVATION SYSTEM FOR THE ORDINAL ANALYSIS OF KP+# 3 REFLECTION
- Anton Setzer # December 7, 1997
- Proof Theory and Martin-Lof Type Anton Setzer
- A Data Type of Partial Recursive Functions in MartinLof Type Theory
- State Dependent IOMonads in Type Theory Markus Michelbrink #
- An upper bound for the proof theoretical strength of Martin-Lof Type Theory
- Ordinalzahlanalyse pradikativer Theorien unter Verwendung von Fundamentalfolgen
- Extending MartinLof Type Theory by One MahloUniverse
- Proof Theory of MartinLof Type Theory --An Anton Setzer #
- The IO Monad in Dependent Type Theory
- EXACT DICKSON ORDINALS MARKUS MICHELBRINK, ANTON SETZER
- Set theoretical proofs as type theoretical Anton Setzer
- Dept. of Computer Science University of Wales Swansea
- A Data Type of Partial Recursive Functions in Martin-Lof Type Theory
- Proof theoretical strength of Martin-Lof Type Theory
- Interactive Programs and Weakly Final Coalgebras in Dependent Type Theory
- A Finite Axiomatization of InductiveRecursive Definitions
- Universes in Type Theory Part II Autonomous Mahlo
- An Introduction to Wellordering Proofs in MartinLof's Type Theory
- Ordinal Systems Anton Setzer \Lambda
- 66 1998 ASSOCIATION FOR SYMBOLIC LOGIC EUROPEAN SUMMER MEETING [5] B. H. Neumann, Journal of the London Mathematical Society, vol. 29 (1954).
- A Finite Axiomatization of Inductive-Recursive Definitions
- A BUCHOLZ DERIVATION SYSTEM FOR THE ORDINAL ANALYSIS OF KP + 3-REFLECTION
- Typing in Special Symbols Typing in the special symbols (using the
- Matematiska Institutionen VT 2000 Uppsala Universitet "Ovning 4
- Inductive-Inductive Definitions Fredrik Nordvall Forsberg# Anton Setzer#
- Translating Set Theoretical Proofs into Type Theoretical Programs
- Matematiska Institutionen VT 2000 Uppsala Universitet "Ovning 1
- Matematiska Institutionen VT 2000 Uppsala Universitet "Ovning 2
- Integrating Functional Programming Into C++:Implementation and Verification
- An extended predicative definition of the Mahlo universe
- Java as a Functional Programming Language Anton Setzer?
- Matematiska Institutionen VT 2000 Uppsala Universitet "Ovning 3
- I ANTON SETZER, Weakly final coalgebras in Martin-L"of type theory. Dept. of Computer Science, Swansea University, Singleton Park Swansea SA2 8PP,
- ==============================================================================E* *lectronic Communications of the EASST
- Universes in Type Theory Part I -Inaccessibles and Mahlo
- Indexed Induction-Recursion Peter Dybjer*and Anton Setzery
- Proof Theory of Martin-L"of Type Theory -An Overview
- Interactive Programs and Weakly Final Coalgebras in Dependent Type Theory
- Interactive Programs in Dependent Type Theory Peter Hancock1 and Anton Setzer2
- Universes in Type Theory Part II -Autonomous Mahlo
- AVoCS 2008 Automated Verification of Signalling
- Ordinal Systems Anton Setzer *
- Indexed Induction-Recursion Peter Dybjer a,?
- A Provably Correct Translation of the ~-Calculus into a Mathematical Model of C++
- A Model for a type theory with Mahlo Universe
- Indexed Induction-Recursion Peter Dybjer a,
- Specifying interactions with dependent types Peter Hancock, Anton Setzer
- Inductiveinductive Definitions Fredrik Nordvall Forsberg # and Anton Setzer #
- Anton Setzer December 18, 1997
- HA # , Constructive Reals and #Calculus.
- An Introduction to Well-ordering Proofs in Martin-L"of's Type Theory
- Set theoretical proofs as type theoretical programs
- AVoCS 2008 Automated Verification of Safety Properties
- Universes in Type Theory Part II -Autonomous Mahlo and 3 -Reflection
- Anton Setzer December 18, 1997
- Corrections to my article "Ordinal Systems" Anton Setzer*
- Induction-Recursion and Initial Algebras
- Well-ordering proofs for Martin-L"of Type Theory ?
- An upper bound for the proof theoretical strength of Martin-L"of Type Theory
- EXACT DICKSON ORDINALS MARKUS MICHELBRINK, ANTON SETZER
- A Data Type of Partial Recursive Functions in Martin-L"of Type Theory
- Object-Oriented Programming in Dependent
- Weak Bisimulation Approximants Will Harwood, Faron Moller, and Anton Setzer?
- A Finite Axiomatization of Inductive-Recursive Definitions
- Object-Oriented Programming in Dependent Type Theory Anton Setzer?
- Matematiska Institutionen VT 2000 Uppsala Universitet "Ovning 5
- Interactive Programs in Dependent Type Theory Peter Hancock1 and Anton Setzer2
- Functional Concepts in C++ Rose H. Abdul Rauf, Ulrich Berger, Anton Setzer?
- A Type Theory for Iterated Inductive Definitions Anton Setzer
- Functional Concepts in C++ Rose H. Abdul Rauf 1 , Ulrich Berger 2 , Anton Setzer 2 3
- A Type Theory for Iterated Inductive Definitions Anton Setzer
- Ordinalzahlanalyse pr adikativer Theorien unter Verwendung von Fundamentalfolgen
- Partial Recursive Functions in Martin-Lof Type Anton Setzer
- Interactive Programs in Dependent Type Theory Peter Hancock1
- Inductive-Inductive Definitions Fredrik Nordvall Forsberg Anton Setzer
- An extended predicative definition of the Mahlo Reinhard Kahle Anton Setzer
- Electronic Communications of the EASST Volume ? (2009)
- Indexed InductionRecursion Peter Dybjer a,#
- InductiveInductive Definitions Fredrik Nordvall Forsberg # Anton Setzer #
- Finite axiomatizations of inductive and inductiverecursive definitions
- Proof theoretical strength of MartinLof Type Theory
- Ordinal Systems, Part 2: One Inaccessible
- Ordinal Systems, Part 2: One Inaccessible
- Wheels Anton Setzer*
- A BUCHOLZ DERIVATION SYSTEM FOR THE ORDINAL ANALYSIS OF KP + 3-REFLECTION
- The IO Monad in Dependent Type Theory
- Partial Recursive Functions in Martin-L"of Type Theory
- A Model for a type theory with Mahlo Universe
- Rules for the 3 -reflecting Universe Anton Setzer*
- Uppsala University Period* Matematiska Institutionen Ht *
- Coalgebras as Types determined by their Elimination Rules
- Extending Martin-L"of Type Theory by One Mahlo-Universe
- HA , Constructive Reals and ~-Calculus.
- Inductive Definitions with Decidable Atomic Formulas
- Interactive Programs and Weakly Final Coalgebras in Dependent Type Theory
- Proof Theory and Martin-L"of Type Theory
- Functional Concepts in C++ Rose H. Abdul Rauf1, Ulrich Berger2, Anton Setzer2 3
- Proof theoretical strength of Martin-L"of Type Theory
- State Dependent IO-Monads in Type Theory Markus Michelbrink*
- Ordinal Systems Anton Setzer *
- Inductive-inductive Definitions Fredrik Nordvall Forsberg# and Anton Setzer#
