Zobrazeno 1 - 10
of 770
pro vyhledávání: '"Normalisation by evaluation"'
Autor:
Fiore, Marcelo
This paper studies normalisation by evaluation for typed lambda calculus from a categorical and algebraic viewpoint. The first part of the paper analyses the lambda definability result of Jung and Tiuryn via Kripke logical relations and shows how it
Externí odkaz:
http://arxiv.org/abs/2207.08777
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Altenkirch, Thorsten, Kaposi, Ambrus
Publikováno v:
Logical Methods in Computer Science, Volume 13, Issue 4 (October 23, 2017) lmcs:2588
We develop normalisation by evaluation (NBE) for dependent types based on presheaf categories. Our construction is formulated in the metalanguage of type theory using quotient inductive types. We use a typed presentation hence there are no preterms o
Externí odkaz:
http://arxiv.org/abs/1612.02462
Autor:
Marcelo Fiore, Philip Saville
Publikováno v:
LICS
Fiore, M & Saville, P 2020, Coherence and normalisation-by-evaluation for bicategorical cartesian closed structure . in LICS '20: Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science . New York, pp. 425–439, Thirty-Fifth Annual ACM/IEEE Symposium on Logic in Computer Science, Saarbrücken, Germany, 8/07/20 . https://doi.org/10.1145/3373718.3394769
Fiore, M & Saville, P 2020, Coherence and normalisation-by-evaluation for bicategorical cartesian closed structure . in LICS '20: Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science . New York, pp. 425–439, Thirty-Fifth Annual ACM/IEEE Symposium on Logic in Computer Science, Saarbrücken, Germany, 8/07/20 . https://doi.org/10.1145/3373718.3394769
We present two proofs of coherence for cartesian closed bicat- egories. Precisely, we show that in the free cartesian closed bicategory on a set of objects there is at most one structural 2-cell between any parallel pair of 1-cells. We thereby reduce
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3aef10944193f4293d106473838d62c8
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Thorsten Altenkirch, Ambrus Kaposi
Publikováno v:
Logical Methods in Computer Science, Vol Volume 13, Issue 4 (2017)
We develop normalisation by evaluation (NBE) for dependent types based on presheaf categories. Our construction is formulated in the metalanguage of type theory using quotient inductive types. We use a typed presentation hence there are no preterms o
Externí odkaz:
https://doaj.org/article/5a2428747d114556b3bc2d24b9bdf32e
Conference
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Vestergaard, René
Publikováno v:
In Electronic Notes in Theoretical Computer Science December 2001 57:163-183
Autor:
Klaus Aehlig, Felix Joachimski
Publikováno v:
Mathematical Structures in Computer Science. 14:587-611
A purely syntactic and untyped variant of Normalisation by Evaluation for the $\lambda$-calculus is presented in the framework of a two-level $\lambda$-calculus with rewrite rules to model the inverse of the evaluation functional. Among its operation
Autor:
René Vestergaard
Publikováno v:
Electronic Notes in Theoretical Computer Science. 57:163-183
We develop the type theory of the Normalisation by Evaluation (NbE) algorithm for the λ-calculus in the simply-typed case. In particular, we show that the algorithm computes long β(η)-normal forms by means of Plotkin's call-by-name and call-by-val