Share This Author
The MERLIN corpus: Learner language and the CEFR
The MERLIN corpus is a written learner corpus for Czech, German, and Italian that has been designed to illustrate the Common European Framework of Reference for Languages (CEFR) with authentic learner data, supporting a broadening of the scope of research in areas such as automatic proficiency classification or native language identification.
Cubical agda: a dependently typed programming language with univalence and higher inductive types
- Andrea Vezzosi, Anders Mörtberg, Andreas Abel
- Computer ScienceJournal of Functional Programming
- 26 July 2019
This paper describes an extension of the dependently typed functional programming language Agda with cubical primitives, making it into a full-blown proof assistant with native support for univalence and a general schema of higher inductive types.
Verifying haskell programs using constructive type theory
- Andreas Abel, Marcin Benke, A. Bove, John Hughes, U. Norell
- Computer ScienceHaskell '05
- 30 September 2005
This paper shows how Agda, a proof assistant based on dependent type theory, can be used to prove theorems about Haskell programs, and claims that, although these Agda models are generated by a relatively complex translation process, proofs about them are simple and natural.
uops.info: Characterizing Latency, Throughput, and Port Usage of Instructions on Intel Microarchitectures
This paper presents the design and implementation of a tool to construct faithful models of the latency, throughput, and port usage of x86 instructions, and introduces a more precise definition of latency that considers dependencies between different pairs of input and output operands.
Higher-Order Dynamic Pattern Unification for Dependent Types and Records
A constraint-based unification algorithm for λΠΣ-calculus which solves a richer class of patterns than currently possible; in particular it takes into account type isomorphisms to translate unification problems containing Σ-types into problems only involving Π-types.
Measurement-based modeling of the cache replacement policy
- Andreas Abel, J. Reineke
- Computer ScienceIEEE 19th Real-Time and Embedded Technology and…
- 9 April 2013
This paper proposes an algorithm to automatically model the cache replacement policy by measurements on the actual hardware, and implements and applies this algorithm to various popular microarchitectures, uncovering a previously undocumented cache replacements policy in the Intel Atom D525.
Copatterns: programming infinite structures by observations
This paper presents a core language for programming with infinite structures by observations together with its operational semantics based on (co)pattern matching, and develops the concept of copattern matching, which allows us to synthesize infinite data.
Iteration and coiteration schemes for higher-order and nested datatypes
Wellfounded recursion with copatterns: a unified approach to termination and productivity
A type-based approach to strong normalization of a core language based on System F-omega by tracking size information about finite and infinite data in the type which guarantees compositionality.
Human-Readable Machine-Verifiable Proofs for Teaching Constructive Logic
A linear syntax for natural deduction proofs in first-order intuitionistic logic is presented, which has been an effective tool for teaching logic and is the core of the tutorial proof checker Tutch.