- LFM 2004 Preliminary Version Normalization for the Simply-Typed
- Generalized Iteration and Coiteration for Higher-Order Nested Datatypes
- A Modular Type-Checking Algorithm for Type Theory with Singleton Types and
- A Third-Order Representation of the -Calculus Andreas Abel
- Semicontinuous Sized Types and Termination Termination Checking via Type Systems
- Normalization by Evaluation for Martin-Lof Type Theory
- Typed Applicative Structures and Normalization by Evaluation for System F
- Institut fur Informatik WS 2008/09 der Universitat Munchen
- MiniAgda: Checking Termination using Sized Types Andreas Abel
- Termination of Functions that Are Passed to Their Arguments
- Polymorphismus Einf uhrendes Beispiel: Polymorphe Listen.
- 1.13. KRIPKEMODELLE 27 1.13 KripkeModelle
- Under consideration for publication in Math. Struct. in Comp. Science Polarized Subtyping for Sized Types
- A Polymorphic LambdaCalculus with Sized HigherOrder Types
- Generalized Iteration and Coiteration for HigherOrder Nested Datatypes
- Extensional Normalization in the Logical Framework with Proof Irrelevant Equality
- Typed Applicative Structures and Normalization by Evaluation for System F #
- Praktikum Compilerbau Wintersemester 2007/08
- Verifying a Semantic -Conversion Test for Martin-Lof Type Theory (extended version)
- Higher-Order Subtyping, Revisited Syntactic Completeness Proofs for Algorithmic Judgements
- Towards Normalization by Evaluation for the ##Calculus of Constructions (Extended Version)
- Einf uhrung in die konstruktive Logik Andreas Abel
- Generalized Iteration and Coiteration for Higher-Order Nested Datatypes
- SEMICONTINUOUS SIZED TYPES AND TERMINATION ANDREAS ABEL
- Weak Normalization for the Simply-Typed Lambda-Calculus in Twelf
- Set-based Operators and Fixed-Points by Support Andreas Abel
- Connecting a Logical Framework to a First-Order Logic Prover (Extended Version)
- Institut fur Informatik SS 2009 der Universitat Munchen
- A Third-Order Representation of the -Calculus
- Weak Normalization for the Simply-Typed Lambda-Calculus in Twelf
- Termination of Mutually Recursive Functions Andreas Abel
- Weak ##Normalization and Normalization by Evaluation for System F
- Praktikum Compilerbau Wintersemester 2005/06
- A Modular Type-Checking Algorithm for Type Theory with Singleton Types and
- PROGRAMMING IN HASKELL Chapter 8 -Functional Parsers
- Haskell Examples for Iteration and Coiteration on Higher-Order Datatypes
- Prufungsstoff Vorlesung Lambda-Kalkul Andreas Abel
- Polarized Subtyping for Sized Types Andreas Abel
- Einf uhrung in die konstruktive Logik Andreas Abel
- Normalization by Evaluation (NbE) Techniques and Abstract Values
- On Parametric Polymorphism and Irrelevance in MartinL of Type Theory Andreas Abel
- Higher-Order Dynamic Pattern Unification for Dependent Types and Records
- Preliminary Report. Final version to appear in: c A. Abel & B. Pientka
- Termination of Mutually Recursive Functions Andreas Abel
- Fixed Points of Type Constructors and Primitive Recursion (Errata)
- Fixed Points of Type Constructors and Primitive Recursion (Errata)
- Vorlesungsskript Rechnergest utztes Beweisen Martin Hofmann
- Institut f ur Informatik SS 2002 der Universit at M unchen
- Introduction to Parigot's Calculus Andreas Abel
- Dynamische Mengen Eine dynamische Menge ist eine Datenstruktur, die eine Menge von Objekten
- Fixed Points of Type Constructors and Primitive Recursion
- A Polymorphic Lambda-Calculus with Sized Higher-Order Types
- Institut fur Informatik WS 2007/2008 der Universitat Munchen
- Explicit Substitutions for Contextual Type Theory Andreas Abel1 Brigitte Pientka2
- Institut fur Informatik SS 2007 der Universitat Munchen
- Institut fur Informatik WS 2007/2008 der Universitat Munchen
- Haskell Examples for Iteration and Coiteration on Higher-Order Datatypes
- Verifying a Semantic ##Conversion Test for MartinLof Type Theory (extended version)
- HigherOrder Dynamic Pattern Unification for Dependent Types and Records
- A Partial Type Checking Algorithm for Type : Type
- ON IRRELEVANCE AND ALGORITHMIC EQUALITY IN PREDICATIVE TYPE THEORY
- Remarks on Typed Equality for the Calculus of Constructions
- Normalization by Evaluation for System F Andreas Abel
- TypeBased Termination and Productivity Checking
- A Semantic Analysis of Structural Recursion Andreas Abel
- Speci cation and Veri cation of a Formal System for
- Specification and Verification of a Formal System for Structurally Recursive Functions
- Verifying Haskell Programs Using Constructive Type Theory
- Fundamenta Informaticae TLCA'05 1--53 1 Untyped Algorithmic Equality for MartinL of's Logical Framework
- Fortgeschrittenenpraktikum Implementierung eines Type Checkers f ur das
- Under consideration for publication in Math. Struct. in Comp. Science Polarized Subtyping for Sized Types
- Institut fur Informatik SS 2007 der Universitat Munchen
- dot -filter for drawing directed graphs neato -filter for drawing undirected graphs
- INSTITUT FUR INFORMATIK DER LUDWIG-MAXIMILIANS-UNIVERSITAT MUNCHEN
- Preliminary Report. Final version to appear in: c A. Abel & B. Pientka
- TypeBased Termination of Generic Programs Andreas Abel
- Untyped Algorithmic Equality for MartinLof's Logical Framework
- Institut f ur Informatik SS 2002 der Universit at M unchen
- A Predicative Analysis of Structural Recursion
- Termination Checking = Type Checking Structural Recursion beyond Subterm Ordering
- Preliminary Report. Final version to appear in: # A. Abel & B. Pientka
- HigherOrder Dynamic Pattern Unification for Dependent Types and Records
- Strong Normalization and Equi-(co)inductive Types
- Untyped Algorithmic Equality for MartinLof's Logical Framework
- Submitted to: # Andreas Abel and Nicolai Kraus
- \A Predicative Strong Normalisation Proof for a -Calculus with Interleaving Inductive Types"
- Strong Normalization for Equi-(Co-)Inductive Types Andreas Abel
- Implementing a Normalizer Using Sized Heterogeneous Types
- Under consideration for publication in J. Functional Programming 1 Implementing a Normalizer
- Generalized Iteration and Coiteration for Higher-Order Nested Datatypes
- Verifying Haskell Programs Using Constructive Type Theory
- Normalization by Evaluation for MartinLof Type Theory
- Typed Applicative Structures and Normalization by Evaluation for System F #
- Implementing a Normalizer Using Sized Heterogeneous Types
- Termination and Guardedness Checking with Continuous Types
- A Modular TypeChecking Algorithm for Type Theory with Singleton Types and
- A semantical analysis of structural recursion Andreas Abel, Thorsten Altenkirch
- Generalized Iteration and Coiteration for Higher-Order Nested Datatypes
- Under consideration for publication in J. Functional Programming 1 A Predicative Analysis of Structural Recursion
- Institut fur Informatik SS 2009 der Universitat Munchen
- Institut fur Informatik WS 2007/2008 der Universitat Munchen
- Irrelevance in Type Theory with a Heterogeneous Equality Judgement
- Untyped Algorithmic Equality for MartinLof's Logical Framework with Surjective Pairs
- A Modular TypeChecking Algorithm for Type Theory with Singleton Types and
- Selected Talks from PLI'02 Andreas Abel TCS Oberseminar, 08.11.2002
- UNITPROP(C, #) = IF C[#] contains the empty clause
- Speci cation and Veri cation of a Formal System for Structurally Recursive Functions
- Normalization by Evaluation for MartinLof Type Theory
- Pr adikatenlogik und Typentheorie
- A Third-Order Representation of the Andreas Abel
- Praktikum Compilerbau Wintersemester 2007/08
- "Termination and Productivity Checking with Continuous Types"
- A Partial Type Checking Algorithm for Type : Type
- On Extensions to Definitional Equality in Agda Or: Making Agda See More
- Generalized Iteration and Coiteration for Higher-Order Nested Datatypes
- A computer-checked proof of the Four Colour Theorem Georges Gonthier
- Verifying a Semantic -Conversion Test for Martin-Lof Type Theory
- Irrelevance in Type Theory with a Heterogeneous Equality Judgement
- Set-based Operators and Fixed-Points by Support Andreas Abel
- Implementing a Normalizer Using Sized Heterogeneous Types
- Normalization by Evaluation for MartinLof Type Theory
- Irrelevance in Type Theory with a Heterogeneous Equality Judgement
- Termination and Guardedness Checking with Continuous Types
- Replace this file with prentcsmacro.sty for your meeting, or with entcsmacro.sty for your meeting. Both can be
- A Third-Order Representation of the -Calculus Andreas Abel
- Termination of Functions that Are Passed to Their Arguments
- Pattern Matching vs. Elimination Rules A Case Study in LEGO
- Normalization by Evaluation for Martin-Lof Type Theory
- Normalization by Evaluation for System F Andreas Abel
- Untyped Algorithmic Equality for Martin-Lof's Logical Framework
- A MODULAR TYPE-CHECKING ALGORITHM FOR TYPE THEORY WITH SINGLETON TYPES AND
- Irrelevance in Type Theory with a Heterogeneous Equality Judgement
- MiniAgda: Integrating Sized and Dependent Types Andreas Abel
- Towards Normalization by Evaluation for the -Calculus of Constructions
- Towards Normalization by Evaluation for the -Calculus of Constructions (Extended Version)
- Extensional Normalization in the Logical Framework with Proof Irrelevant Equality
- Type-Based Termination of Generic Programs Andreas Abel
- Under consideration for publication in Math. Struct. in Comp. Science Polarized Subtyping for Sized Types
- Weak -Normalization and Normalization by Evaluation for System F
- Syntactic Metatheory of Higher-Order Subtyping
- Mixed Inductive/Coinductive Types and Strong Normalization
- Syntactical Strong Normalization for Intersection Types with Term Rewriting Rules
- Strong Normalization and Equi-(co)inductive Types
- Fundamenta Informaticae TLCA'05 153 1 Untyped Algorithmic Equality for Martin-Lof's Logical Framework
- Verifying Haskell Programs Using Constructive Type Theory Andreas Abel Marcin Benke Ana Bove John Hughes Ulf Norell
- Connecting a Logical Framework to a First-Order Logic Prover
- Untyped Algorithmic Equality for Martin-Lof's Logical Framework with Surjective Pairs
- Iteration and Coiteration Schemes for Higher-Order and Nested Datatypes
- Fixed Points of Type Constructors and Primitive Recursion
- Theoretical Informatics and Applications Will be set by the publisher Informatique Theorique et Applications
- Termination and Productivity Checking with Continuous Types
- Termination Checking with Types Strong Normalization for
- "A Predicative Strong Normalisation Proof for a -Calculus with Interleaving Inductive Types"
- A semantical analysis of structural recursion Andreas Abel, Thorsten Altenkirch
- foetus -Termination Checker for Simple Functional Programs
- On Parametric Polymorphism and Irrelevance in Martin-Lof Type Theory Andreas Abel
- Algorithmic Equality for the Calculus of Constructions
- Normalization by Evaluation for the Calculus of Constructions
- Type Structures and Normalization by Evaluation for System F
- INSTITUT FR INFORMATIK DER LUDWIGMAXIMILIANSUNIVERSITT MNCHEN
- Higher-Order Pattern Unification for Dependently Typed Records
- Irrelevance in Type Theory Andreas Abel
- Irrelevance in Type Theory Andreas Abel
- On Irrelevance and Extraction in Type Theory Andreas Abel
- Sized Types in Agda Andreas Abel
- Normalization by Evaluation for System F Andreas Abel
- Type-Based Termination of Functional Programs Andreas Abel
- Normalization by Evaluation for Martin-Lof Type Theory
- Semi-continuous Sized Types and Termination Termination Checking via Type Systems
- Sized (Co-)Inductive Types With Applications to Generic Programming
- Untyped Algorithmic Equality for Martin-Lof's Logical Framework
- Weak Normalization for the Simply-Typed Lambda-Calculus in Twelf
- Generalized Iteration and Coiteration for Higher-Order Nested Datatypes
- A Higher-Order Polymorphic Lambda-Calculus With Sized Types
- Slide 1 TOPOLOGY Slide 2 TOPOLOGY
- Specification and Verification of a Formal System for
- A Predicative Analysis of Structural Recursion
- A Semantic Analysis of Structural Recursion Andreas Abel
- Fortgeschrittenenpraktikum Implementierung eines Type Checkers fur das
- Institut fur Informatik WS 2006/07 der Universitat Munchen
- Funktionale Programmierung Andreas Abel, Hans-Wolfgang Loidl
- Institut fur Informatik SS 2009 der Universitat Munchen
- Polymorphismus Haskell Prelude Lazy Evaluation Zusammenfassung Beispiel Funktionale Programmierung
- Funktionale Programmierung Graphische Benutzeroberflachen mit Gtk2Hs
- Verifying Program Optimizations in Agda Case Study: List Deforestation
- Institut fur Informatik SS 2007 der Universitat Munchen
- Institut fur Informatik SS 2007 der Universitat Munchen
- Institut fur Informatik SS 2007 der Universitat Munchen
- Institut fur Informatik SS 2007 der Universitat Munchen
- Einfuhrung in die konstruktive Logik Andreas Abel
- Computer Aided Formal Reasoning 2005 Martin Hofmann Uebungsblatt 6 Sorting
- Praktikum Compilerbau Wintersemester 2007/08
- Praktikum Compilerbau Wintersemester 2007/08
- Praktikum Compilerbau Wintersemester 2007/08
- Praktikum Compilerbau Wintersemester 2005/06
- Drawing graphs with dot Emden Gansner and Eleftherios Koutsofios and Stephen North
- Institut fur Informatik SS 2006 der Universitat Munchen
- Institut fur Informatik SS 2006 der Universitat Munchen
- Vorlesungsskript Rechnergestutztes Beweisen Martin Hofmann
- Effiziente Algorithmen Martin Hofmann und Jan Johannsen
- String matching: Uberblick String matching = Erkennung von Zeichenketten.
- Compilerbau WS05/06 Implementierung Funktionaler
- (Co-)Iteration for Higher-Order Nested Datatypes
- Syntactic Normalization Proofs Andreas Abel
- Algorithmen und Datenstrukturen Martin Hofmann
- The smallest networks on which the Ford-Fulkerson maximum ow procedure may fail to terminate
- A Tutorial Introduction to PVS Presented at WIFT '95: Workshop on IndustrialStrength Formal
- Towards Normalization by Evaluation for the ##Calculus of Constructions
- Constructors transformers
- Polarized Subtyping for Sized Types Andreas Abel
- Towards Normalization by Evaluation for the Calculus of Constructions
- Higher-Order Dynamic Pattern Unification for Dependent Types and Records
- ON IRRELEVANCE AND ALGORITHMIC EQUALITY IN PREDICATIVE TYPE THEORY
- Praktikum Compilerbau Wintersemester 2005/06
- Division nach Beame, Cook und Hoover Andreas Abel
- Verifying Haskell Programs Using Constructive Type Theory # Andreas Abel Marcin Benke Ana Bove John Hughes Ulf Norell
- Syntactical Strong Normalization for Intersection Types with Term Rewriting Rules
- Praktikum Compilerbau Wintersemester 2007/08
- Syntactical Strong Normalization of Intersection Types with Term Rewriting Rules
- Konzepte Basistypen Algebraische Datentypen Funktionen hoherer Ordnung Beispiel Zusammenfassung Funktionale Programmierung
- Funktionale Programmierung Der ghci Interpreter
- Type-Based Termination and Productivity Checking
- Strong Normalization for Equi-(Co-)Inductive Types Andreas Abel
- Theoretical Informatics and Applications Will be set by the publisher Informatique Theorique et Applications
- Termination and Guardedness Checking with Continuous Types
- Under consideration for publication in Math. Struct. in Comp. Science Polarized Subtyping for Sized Types
- Connecting a Logical Framework to a FirstOrder Logic Prover (Extended Version) #
- Towards Generic Programming with Sized Types Termination of Generic Programs
- Untyped Algorithmic Equality for Martin-Lof's Logical Framework
- Generalized Iteration and Coiteration for Higher-Order Nested Datatypes
- Typed Applicative Structures and Normalization by Evaluation for System F
- A Predicative Strong Normalisation Proof for a -calculus with Interleaving Inductive Types
- Verifying a Semantic -Conversion Test for Martin-Lof Type Theory
- Grundlagen Semi-explizite Parallelitat Explizite Parallelitat Nested Data Parallelism Funktionale Programmierung
- Institut fur Informatik WS 2007/2008 der Universitat Munchen
- Zirkulare Programme Memoisation Termination von zirkularen Programmen Red-Black Trees Funktionale Programmierung
- On Irrelevance and Extraction in Type Theory Andreas Abel
- Semi-continuous Sized Types and Termination Termination Checking via Type Systems
- Termination of Mutually Recursive Functions with Several Arguments
- Mixed Inductive/Coinductive Types and Strong Normalization
- Untyped Algorithmic Equality for MartinLof's Logical Framework
- Die Ziege auf der kreisfoermigen Wiese Aufgabenstellung
- Slide 1 TOPOLOGY Slide 3 TOTALITY
- Institut f ur Informatik SS 2002 der Universit at M unchen
- Weak Normalization for the Simply-Typed Lambda-Calculus in Twelf
- Institut fur Informatik WS 2007/2008 der Universitat Munchen
- Funktionale Programmierung Folds und Nested Datatypes
- Grundlagen Scrap Your Boilerplate Type-indexed data-types Zusammenfassung Funktionale Programmierung
- Normalization by Evaluation for Martin-Lof Type Theory
- Type-Based Termination for Dependent Types Andreas Abel
- Syntactic Metatheory of Higher-Order Subtyping
- A Modular Type-Checking Algorithm for Type Theory with Singleton Types and
- ON IRRELEVANCE AND ALGORITHMIC EQUALITY IN PREDICATIVE TYPE THEORY
- Termination of Functions that Are Passed to Their Arguments
- Semi-conti==============================================================* *================================================================nuous Sized *
- Untyped Algorithmic Equality for Martin-L"of's Logical Framework
- Semi-continuous Sized Types and Termination Andreas Abel?
- A Third-Order Representation of the ~~-Calculus
- Type-Based Termination of Generic Programs Andreas Abel
- Normalization by Evaluation for Martin-L"of Type Theory with Typed Equality Judgements
- Towards Normalization by Evaluation for the fij-Calculus of Constructions
- Constructing Type-Safe Operators for Software Composition?
- Strong Normalization and Equi-(co)inductive Types
- Weak Normalization for the Simply-Typed Lambda-Calculus in Twelf
- *===================================================================Normalizat* *ion by Evaluation for
- Extensional Normalization in the Logical Framework with Proof Irrelevant Equality
- Towards Normalization by Evaluation for the fij-Calculus of Constructions (Extended Version)
- foetus -Termination Checker for Simple Functional Programs
- Higher-Order Dynamic Pattern Unification for Dependent Types and Records
- Untyped Algorithmic Equality for Martin-L"of's Logical Framework
- Under consideration for publication in Math. Struct. in Comp. Science Polarized Subtyping for Sized Types
- A Predicative Strong Normalisation Proof for a -calculus with Interleaving Inductive Types
- A Coinductive Formulation of the ``Coinduction Theorem'' by Michael and Appel
- Human-Readable Machine-Veri able Proofs for Teaching Constructive Logic
- Semi-continuous Sized Types and Termination Andreas Abel
- INSTITUT F UR INFORMATIK
- Tutch User's Guide Version 0.52 beta
- Weak Normalization for the Simply-Typed Lambda-Calculus in Twelf
- A Higher-Order Polymorphic Lambda-Calculus With Sized Types
- Towards Generic Programming with Sized Types Termination of Generic Programs
- Institut fur Informatik SS 2006 der Universitat Munchen
- Termination and Guardedness Checking with Continuous Types
- Irrelevance in Type Theory Andreas Abel
- Submitted to: c Andreas Abel and Nicolai Kraus
- Connecting a Logical Framework to a FirstOrder Logic Prover #
- 16 KAPITEL 1. AUSSAGENLOGIK 1.10 Fragment ###: Beweisreduktionen und nor
- Syntactic Metatheory of HigherOrder Subtyping
- (Co-)Iteration for Higher-Order Nested Datatypes
- Termination and Productivity Checking with Continuous Types
- foetus -Termination Checker for Simple Functional Programs
- foetus -Termination Checker for Simple Functional Andreas Abel
- Parametric Dependent Function Types Andreas Abel
- Praktikum Compilerbau Wintersemester 2005/06
- Weak Normalization for the Simply-Typed Lambda-Calculus in Twelf
- MiniAgda: Checking Termination using Sized Types Andreas Abel
- Replace this file with prentcsmacro.sty for your meeting, or with entcsmacro.sty for your meeting. Both can be
- Human-Readable Machine-Verifiable Proofs for Teaching Constructive Logic
- Explicit substitutions for contextual type theory Andreas Abel
- MiniAgda: Integrating Sized and Dependent Types Andreas Abel*
- | Termination of Mutually Recursive Functions | | with Several Arguments |
- SEMI-CONTINUOUS SIZED TYPES AND TERMINATION ANDREAS ABEL
- Syntactical Strong Normalization for Intersection Types with Term Rewriting Rules
- Implementing a Normalizer Using Sized Heterogeneous Types
- Weak Normalization for the Simply-Typed Lambda-Calculus in Twelf
- Weak Normalization for the Simply-Typed Lambda-Calculus in Twelf
- Weak fij-Normalization and Normalization by Evaluation for System F
- "Termination and Productivity Checking with Continuous Types"
- Higher-Order Subtyping, Revisited Syntactic Completeness Proofs for Algorithmic Judgements
- A Modular Type-Checking Algorithm for Type Theory with Singleton Types and
- MSFP 2008 A Partial Type Checking Algorithm for
- A Predicative Strong Normalisation Proof for a ~-calculus with Interleaving Inductive Types
- Tutch User's Guide Version 0.52 beta
- Connecting a Logical Framework to a First-Order Logic Prover?
- Theoretical Informatics and Applications Will be set by the publisher Informatique Th'eorique et Applications
- Under consideration for publication in Math. Struct. in Comp. Science Polarized Subtyping for Sized Types
- Normalization by Evaluation for Martin-L"of Type Theory
- Connecting a Logical Framework to a First-Order Logic Prover (Extended Version)?
- Typed Applicative Structures and Normalization by Evaluation for System F!
- "A Predicative Strong Normalisation Proof for a ~-Calculus with Interleaving Inductive Types"
- Type-Based Termination and Productivity Checking
- A MODULAR TYPE-CHECKING ALGORITHM FOR TYPE THEORY WITH SINGLETON TYPES AND
- Verifying Haskell Programs Using Constructive Type Theory
- (Co-)Iteration for Higher-Order Nested Datatypes
- Sized (Co-)Inductive Types With Applications to Generic Programming
- *===================================================================Normalizat* *ion by Evaluation for
- Verifying a Semantic fij-Conversion Test for Martin-L"of Type Theory
- Untyped Algorithmic Equality for Martin-L"of 's Logical Framework with Surjective Pairs
- Irrelevance in Type Theory with a Heterogeneous Equality Judgement
- Polarized Subtyping for Sized Types Andreas Abel
- Generalized Iteration and Coiteration for Higher-Order Nested Datatypes
- On Parametric Polymorphism and Irrelevance in Martin-L"of Type Theory Andreas Abel
- Prufungsstoff Vorlesung Lambda-Kalkul Andreas Abel
- Constructing Type-Safe Operators for Software Composition ?
- LFM 2004 Preliminary Version Normalization for the SimplyTyped
- Iteration and Coiteration Schemes for Higher-Order and Nested Datatypes
- MiniAgda: Integrating Sized and Dependent Types Andreas Abel #
- A MODULAR TYPECHECKING ALGORITHM FOR TYPE THEORY WITH SINGLETON TYPES AND
- Verifying a Semantic ##Conversion Test for MartinLof Type Theory
- Under consideration for publication in J. Functional Programming 1 Implementing a Normalizer
- Semicontinuous Sized Types and Termination Andreas Abel #
- Sized (Co)Inductive Types With Applications to Generic Programming
- How to give a good research talk Simon L Peyton Jones John Hughes John Launchbury
- Termination Checking with Types Strong Normalization for
- Normalization by Evaluation for MartinL of Type Theory with Typed Equality Judgements
- Institut fur Informatik SS 2007 der Universitat Munchen
- Normalization by Evaluation (NbE) Techniques and Abstract Values
- Intel Architecture Software Developer's
- An Introduction to Dependent Types and Andreas Abel
- On the Algebraic Foundation of Proof Assistants
- Normalization by Evaluation for Martin-Lof Type Theory with Typed Equality Judgements
- Implementing a Normalizer Using Sized Heterogeneous Types
- Constructing Type-Safe Operators for Software Composition
- Praktikum Compilerbau Wintersemester 2007/08
- Termination of Mutually Recursive Functions with Several Arguments
- SEMI-CONTINUOUS SIZED TYPES AND TERMINATION ANDREAS ABEL
- Under consideration for publication in J. Functional Programming 1 A Predicative Analysis of Structural Recursion
- Preliminary Report. Final version to appear in: # A. Abel & B. Pientka
- Termination and Guardedness Checking with Continuous Types
- SPASS Input Syntax Version 1.5
- Normalization by Evaluation for System F Andreas Abel
- Mixed Inductive/Coinductive Types and Strong Normalization
- Generalized Iteration and Coiteration for Higher-Order Nested Datatypes
- Explicit Substitutions for Contextual Type Theory Andreas Abel
- Towards Generic Programming with Sized Types Termination of Generic Programs
- Under consideration for publication in J. Functional Programming 1 A Predicative Analysis of Structural Recursion
- Implementing a Normalizer Using Sized Heterogeneous Types
- Fixed Points of Type Constructors and Primitive Recursion (Errata)
- LFM 2004 Preliminary Version Normalization for the Simply-Typed
- Curriculum Vitae Full name: Andreas Martin Abel
- Verifying a Semantic fij-Conversion Test for Martin-L"of Type Theory (extended version)
- Set-based Operators and Fixed-Points by Support Andreas Abel
- A Polymorphic Lambda-Calculus with Sized Higher-Order Types
- Termination of Mutually Recursive Functions Andreas Abel
- | A Semantic Analysis of Structural Recursion * Slide 1 || *
- Termination Checking with Types Strong Normalization for
- Termination and Productivity Checking with Continuous Types
- Iteration and Coiteration Schemes for Higher-Order and Nested Datatypes
- Under consideration for publication in J. Functional Programming 1 Implementing a Normalizer
- Replace this file with prentcsmacro.sty for your meeting, or with entcsmacro.sty for your meeting. Both can be
- Untyped Algorithmic Equality for Martin-L"of's Logical Framework
- | A Predicative Analysis || | of Structural Recursion ||
- Verifying Haskell Programs Using Constructive Type Theory * Andreas Abel Marcin Benke Ana Bove John Hughes Ulf Norell
- Normalizati==========================================================* *====================================================================on by E*
- | Specification and Verification || | of a Formal System for ||
- Fundamenta Informaticae TLCA'05 1-53 * * 1
- INSTITUT FU"R INFORMATIK DER LUDWIG-MAXIMILIANS-UNIVERSITA"T MU"NCHEN
- A Lambda Term Representation Based on Linear Ordered Logic
- Human-Readable Machine-Verifiable Proofs for Teaching Constructive Logic
- Higher-Order Dynamic Pattern Unification for Dependent Types and Records
- Typed Applicative Structures and Normalization by Evaluation for System F!
- Specification and Verification of a Formal System for Structurally Recursive Functions
- Normalization by Evaluation for Martin-L"of Type Theory with Typed Equality Judgements
- Haskell Examples for Iteration and Coiteration on Higher-Order Datatypes
- Fixed Points of Type Constructors and Primitive Recursion
- Irrelevance in Type Theory with a Heterogeneous Equality Judgement
- Praktikum Compilerbau Wintersemester 2007/08
- Higher-Order Dynamic Pattern Unification for Dependent Types and Records
- Erratum in "Verifying a Semantic fij-Conversion Test for
- Universe Subtyping in Martin-Lof Type Theory Internship Report
- Towards a Total Dependently Typed Core Language Andreas Abel
- ``Verifying a Semantic ##Conversion Test for MartinLof Type Theory''
- "Verifying a Semantic -Conversion Test for Martin-Lof Type Theory"
- Higher-Order Subtyping for Dependent Types Andreas Abel
- On -Expansion in NbE and Type Casts Andreas Abel
- On Shape Irrelevance and Polymorphism in Type Theory Andreas Abel
- EPTCS ??, 20??, pp. 1--11, doi:10.4204/EPTCS.??.?? # Andreas Abel
- MiniAgda: Checking Termination using Sized Types Andreas Abel
- EPTCS ??, 20??, pp. 111, doi:10.4204/EPTCS.??.?? c Andreas Abel
- Type-Based Termination, Inflationary Fixed-Points, and Mixed Inductive-Coinductive Types
- A Semantics for Agda's Mixed Inductive-Coinductive Andreas Abel
