Zobrazeno 1 - 10
of 58
pro vyhledávání: '"Pure type systems"'
Autor:
Felicissimo, Thiago
Publikováno v:
FSCD 2022-7th International Conference on Formal Structures for Computation and Deduction
FSCD 2022-7th International Conference on Formal Structures for Computation and Deduction, Aug 2022, Haifa, Israel. ⟨10.4230/LIPIcs.FSCD.2022.25⟩
FSCD 2022-7th International Conference on Formal Structures for Computation and Deduction, Aug 2022, Haifa, Israel. ⟨10.4230/LIPIcs.FSCD.2022.25⟩
Dedukti is a very expressive logical framework which unlike most frameworks, such as the Edinburgh Logical Framework (LF), allows for the representation of computation alongside deduction. However, unlike LF encodings, Dedukti encodings proposed unti
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0cb45f28a349a130ef7f66443b96e721
Autor:
Kamareddine, Fairouz, Laan, Twan
Publikováno v:
Journal of Logic, Language, and Information, 2001 Jul 01. 10(3), 375-402.
Externí odkaz:
https://www.jstor.org/stable/40180289
Autor:
Monnier, Stefan, Bos, Nathaniel
Of all the threats to the consistency of a type system, such as side effects and recursion, impredicativity is arguably the least understood. In this paper, we try to investigate it using a kind of blackbox reverse-engineering approach to map the lan
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7309db8df6c26dbe5cd6f2b015d750d9
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.
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:
Assaf, Ali
The lambda Pi calculus can be extended with rewrite rules to embed any functional pure type system. In this paper, we show that the embedding is conservative by proving a relative form of normalization, thus justifying the use of the lambda Pi calcul
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::965b6b8962919f8ed47d486471c20acc
http://arxiv.org/abs/1504.05038
http://arxiv.org/abs/1504.05038
Autor:
Felix Joachimski
Publikováno v:
Information and Computation. 182(1):53-71
By a detailed analysis of the interaction between β-reduction →β and η-expansion →η̄ in the simply typed λ-calculus, a modular and purely syntactic proof method is devised in order to derive strong normalization of the combined reduction
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e9d9076df392e83d41114396a5d3c5db
Autor:
Michael Franssen
Publikováno v:
Electronic Notes in Theoretical Computer Science. 17:1-23
We consider Pure Type Systems (PTSs) extended with a mechanism for parametric terms. In this paper we introduce a PTS called λP— utilizing this extension. λP— exactly corresponds to first-order predicate logic, unlike the usual embedding of thi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::34387b4a7b33947256adaec845e5834b
Autor:
Lasson, Marc
Cette thèse porte sur l’adaptation de la réalisabilité et la paramétricité au cas des types dépendants dans le cadre des Systèmes de Types Purs. Nous décrivons une méthode systématique pour construire une logique à partir d’un langage
Externí odkaz:
http://www.theses.fr/2012ENSL0764/document
Autor:
Ferruccio Guidi, Andrea Asperti
Publikováno v:
TLDI
We extend Pure Type Systems with a function turning each term M of type A into a dummy |M| of the same type (|.| is not an identity, in that M ≠ |M|). Intuitively, a dummy represents an unknown, canonical object of the given type: dummies are opaqu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b59c5c874510e51424df9e1f84ddc252
https://doi.org/10.1145/2103786.2103797
https://doi.org/10.1145/2103786.2103797