Zobrazeno 1 - 10
of 62
pro vyhledávání: '"Abel, Andreas P."'
Autor:
Abel, Andreas
We introduce a simple functional language foetus (lambda calculus with tuples, constructors and pattern matching) supplied with a termination checker. This checker tries to find a well-founded structural order on the parameters on the given function
Externí odkaz:
http://arxiv.org/abs/2407.06924
Autor:
Abel, Andreas
McBride and Paterson introduced Applicative functors to Haskell, which are equivalent to the lax monoidal functors (with strength) of category theory. Applicative functors F are presented via idiomatic application $\_\circledast\_ : F (A \to B) \to F
Externí odkaz:
http://arxiv.org/abs/2401.14286
Publikováno v:
IEEE International Symposium on Workload Characterization, IISWC 2023, Ghent, Belgium, October 1-3, 2023
Basic-block throughput models such as uiCA, IACA, GRANITE, Ithemal, llvm-mca, OSACA, or CQA guide optimizing compilers and help performance engineers identify and eliminate bottlenecks. For this purpose, basic-block throughput models should ideally b
Externí odkaz:
http://arxiv.org/abs/2310.13212
Autor:
Abel, Andreas
This document provides a formal proof of Birkhoff's completeness theorem for multi-sorted algebras which states that any equational entailment valid in all models is also provable in the equational theory. More precisely, if a certain equation is val
Externí odkaz:
http://arxiv.org/abs/2111.07936
Autor:
Abel, Andreas, Reineke, Jan
Publikováno v:
2022 International Conference on Supercomputing (ICS '22), June 28--30, 2022, Virtual Event, USA
Performance models that statically predict the steady-state throughput of basic blocks on particular microarchitectures, such as IACA, Ithemal, llvm-mca, OSACA, or CQA, can guide optimizing compilers and aid manual software optimization. However, the
Externí odkaz:
http://arxiv.org/abs/2107.14210
Flushing the cache, using instructions like clflush and wbinvd, is commonly proposed as a countermeasure against access-based cache attacks. In this report, we show that several Intel caches, specifically the L1 caches in some pre-Skylake processors
Externí odkaz:
http://arxiv.org/abs/2005.13853
Autor:
Abel, Andreas, Coquand, Thierry
Publikováno v:
Logical Methods in Computer Science, Volume 16, Issue 2 (June 30, 2020) lmcs:6068
Normalization fails in type theory with an impredicative universe of propositions and a proof-irrelevant propositional equality. The counterexample to normalization is adapted from Girard's counterexample against normalization of System F equipped wi
Externí odkaz:
http://arxiv.org/abs/1911.08174
Autor:
Abel, Andreas, Reineke, Jan
We present nanoBench, a tool for evaluating small microbenchmarks using hardware performance counters on Intel and AMD x86 systems. Most existing tools and libraries are intended to either benchmark entire programs, or program segments in the context
Externí odkaz:
http://arxiv.org/abs/1911.03282
We describe a Martin-L\"of-style dependent type theory, called Cocon, that allows us to mix the intensional function space that is used to represent higher-order abstract syntax (HOAS) trees with the extensional function space that describes (recursi
Externí odkaz:
http://arxiv.org/abs/1905.02617
Autor:
Abel, Andreas, Sattler, Christian
We observe that normalization by evaluation for simply-typed lambda-calculus with weak coproducts can be carried out in a weak bi-cartesian closed category of presheaves equipped with a monad that allows us to perform case distinction on neutral term
Externí odkaz:
http://arxiv.org/abs/1902.06097