#### Filter Results:

- Full text PDF available (48)

#### Publication Year

1936

2017

- This year (3)
- Last 5 years (13)
- Last 10 years (32)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Andreas Abel, Ralph Matthes, Tarmo Uustalu
- Theor. Comput. Sci.
- 2005

This article studies the implementation of inductive and coinductive constructors of higher kinds (higher-order nested datatypes) in typed term rewriting, with emphasis on the choice of the iterationâ€¦ (More)

A linear syntax for natural deduction proofs in first-order intuitionistic logic is presented, which has been an effective tool for teaching logic. The proof checking algorithm is also given, whichâ€¦ (More)

- Andreas Abel
- ITA
- 2004

The paradigm of type-based termination is explored for functional programming with recursive data types. The article introducesÎ›Î¼ , a lambda-calculus with recursion, inductive types, subtyping andâ€¦ (More)

- Andreas Abel, Marcin Benke, Ana Bove, John Hughes, Ulf Norell
- Haskell
- 2005

Proof assistants based on dependent type theory are closely related to functional programming languages, and so it is tempting to use them to prove the correctness of functional programs. In thisâ€¦ (More)

- Joselyn Burdine, M. R. FÃ©lix, Andreas Abel, C J Wiltraut, Y J Musselman
- Health services research
- 2000

OBJECTIVE
To describe the relationships among functional health status measures (SF-12 physical and mental components summary scores), traditional measures of community health status, and socialâ€¦ (More)

- Andreas Abel
- 2007

- Andreas Abel
- PAR
- 2010

Sized types are a modular and theoretically well-understood tool for checking termination of recursive and productivity of corecursive definitions. The essential idea is to track structural descentâ€¦ (More)

- Andreas Abel, Klaus Aehlig, Peter Dybjer
- Electr. Notes Theor. Comput. Sci.
- 2007

We present an algorithm for computing normal terms and types in Martin-LÃ¶f type theory with one universe and eta-conversion. We prove that two terms or types are equal in the theory iff the normalâ€¦ (More)

- Andreas Abel, Brigitte Pientka
- TLCA
- 2011

While higher-order pattern unification for the Î»-calculus is decidable and unique unifiers exists, we face several challenges in practice: 1) the pattern fragment itself is too restrictive for manyâ€¦ (More)

- Andreas Abel
- MSFP@MPC
- 2006

In the simply-typed lambda-calculus, a hereditary substitution replaces a free variable in a normal form r by another normal form s of type a, removing freshly created redexes on the fly. It can beâ€¦ (More)