Výsledky vyhledávání - "Pure type system"

Akademický článek

Verified Representations of Landau's 'Grundlagen' in the lambda-delta Family and in the Calculus of Constructions

Autor: Ferruccio Guidi

Publikováno v: Journal of Formalized Reasoning, Vol 8, Iss 1, Pp 93-116 (2016)

Landau's "Grundlagen der Analysis" formalized in the language Aut-QE, represents an early milestone in computer-checked mathematics and is the only non-trivial development finalized in the languages of the Automath family. Here we discuss an implemen

Externí odkaz: https://doaj.org/article/115cf89d97ec4609a7b05f2fadccbd79

Zobrazit plný text záznamu

Formal metatheory of the Lambda calculus using Stoughton's substitution

Autor: Álvaro Tasistro, Nora Szasz, Ernesto Copello

Publikováno v: Theoretical Computer Science. 685:65-82

We develop metatheory of the Lambda calculus in Constructive Type Theory, using a first-order presentation with one sort of names for both free and bound variables and without identifying terms up to α -conversion. Concerning β -reduction, we prove

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::bbda5347848e0d1fe760ca4651328e1c
https://doi.org/10.1016/j.tcs.2016.08.025

Zobrazit plný text záznamu

Formal verification of the equivalence of system F and the pure type system L2

Autor: Kaiser, Jonas

We develop a formal proof of the equivalence of two different variants of System F. The first is close to the original presentation where expressions are separated into distinct syntactic classes of types and terms. The second, L2 (also written as λ

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::87b60653478b37652f4e70e07cc493d6

Zobrazit plný text záznamu

Bridging Curry and Church's typing style

Autor: Jonathan P. Seldin, Joseph Brian Wells, Fairouz Kamareddine

Publikováno v: Journal of Applied Logic. 18:42-70

There are two versions of type assignment in the -calculus: Church-style, in which the type of each variable is fixed, and Curry-style (also called domain free), in which it is not. As an example, in Church-style typing, x:A.x is the identity functio

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::a91bf0c829b3292642afa52a7f1c0022
https://doi.org/10.1016/j.jal.2016.05.008

Zobrazit plný text záznamu

The Grammar of Platonism

Autor: Hartley Slater

Publikováno v: Logica Universalis. 10:533-541

In this paper, based on a critical analysis of ideas of Frege, Quine and Prior, we show how Lambda Calculus and Hilbert’s Epsilon Calculus are useful to give us a good understanding of Platonic objects.

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::87f9b11910603e0f2a6c8bb76dbaf440
https://doi.org/10.1007/s11787-016-0157-9

Zobrazit plný text záznamu

Graph easy sets of mute lambda terms

Autor: Giordano Favro, Antonino Salibra, Antonio Bucciarelli, Alberto Carraro

Publikováno v: Theoretical Computer Science. 629:51-63

Among the unsolvable terms of the lambda calculus, the mute ones are those having the highest degree of undefinedness. In this paper, we define for each natural number n, an infinite and recursive set M n of mute terms, and show that it is graph-easy

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::87a3963bbca034ea0365a7da08d937ed
https://doi.org/10.1016/j.tcs.2015.12.024

Zobrazit plný text záznamu

Verified Representations of Landau's 'Grundlagen' in the lambda-delta Family and in the Calculus of Constructions

Autor: Guidi, Ferruccio

Publikováno v: Journal of Formalized Reasoning, Vol 8, Iss 1, Pp 93-116 (2016)

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::165b6c4a85111afbdb6fec880cb95568
https://jfr.unibo.it/article/view/4716

Zobrazit plný text záznamu

Probabilistic reasoning about simply typed Lambda terms

Autor: Silvia Ghilezan, Simona Kašterović, Nenad Savić, Zoran Ognjanović, Jelena Ivetić

Publikováno v: Logical Foundations of Computer Science ISBN: 9783319720555
LFCS

Reasoning with uncertainty has gained an important role in computer science, artificial intelligence and cognitive science. These applications urge for development of formal models which capture reasoning of probabilistic features. We propose a forma

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e56cd40e2c829e0e0e26054213f23021

Zobrazit plný text záznamu

The systems engineering of consistent pure language with effect type system for certified applications and higher languages

Autor: Maksym Sokhatskyi, Pavlo Maslianko

Publikováno v: AIP Conference Proceedings.

This paper presents the design of the Om language and an implementation of its type checker and bytecode extractor to Erlang. Om is an intermediate language based on a pure type system with the infinite number of universes, so it is known to be consi

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::1db56e385954539e6c1ecef6efa18a56
https://doi.org/10.1063/1.5045439

Zobrazit plný text záznamu

The vectorial λ-calculus

Autor: Pablo Arrighi, Benoît Valiron, Alejandro Díaz-Caro

Publikováno v: Information and Computation
Information and Computation, 2017, 254 (1), pp.105--139. ⟨10.1016/j.ic.2017.04.001⟩
Information and Computation, Elsevier, 2017, 254 (1), pp.105--139. ⟨10.1016/j.ic.2017.04.001⟩
CONICET Digital (CONICET)
Consejo Nacional de Investigaciones Científicas y Técnicas
instacron:CONICET

We describe a type system for the linear-algebraic λ-calculus. The type system accounts for the linear-algebraic aspects of this extension of λ-calculus: it is able to statically describe the linear combinations of terms that will be obtained when

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a524e1701369bc434b717fe8c6a7f674
https://hal.science/hal-01785464/document

Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání