Zobrazeno 1 - 10
of 233
pro vyhledávání: '"lambda-calcul"'
Autor:
Danny Willems
La programmation modulaire est un principe de développement consistant à séparer une application en composants plus petits appelés modules. Le langage de programmation OCaml contient un langage de modules qui permet aux développeurs d'utiliser l
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::05b342c081438df81c17d3035c3ed2bc
Autor:
Vanoni, Gabriele <1994>
Publikováno v:
Computer Science [cs]. Università di Bologna [Bologna], 2022. English. ⟨NNT : ⟩
Slot and van Emde Boas Invariance Thesis states that a time (respectively, space) cost model is reasonable for a computational model C if there are mutual simulations between Turing machines and C such that the overhead is polynomial in time (respect
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3cde3a8ef4556ca7bbfcb1b8a9f698c1
Autor:
Vaux, Lionel
Publikováno v:
Logique en informatique [cs.LO]. Aix-Marseille Université, 2021
Le développement de Taylor des λ-termes et des preuves de la logique linéaire est le fruit d’une relecture syntaxique par Ehrhard et Regnier de la sémantique quantitative de Girard : il associe à chaque terme ou preuve une combinaison linéair
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::4ac8ee89272f44d05ce130bc42756730
https://tel.archives-ouvertes.fr/tel-03515566/file/hdr.pdf
https://tel.archives-ouvertes.fr/tel-03515566/file/hdr.pdf
Autor:
Leberle, Maico
Publikováno v:
Symbolic Computation [cs.SC]. Institut Polytechnique de Paris, 2021. English. ⟨NNT : 2021IPPAX023⟩
In this thesis, we present a quantitative study of the call-by-need lambda-calculus, both from type-theoretical and operational standpoints.Type-theoretically speaking, we derive several multi type systems—a non-idempotent variant of intersection t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::db80061695c3f694bcec16e544057797
https://tel.archives-ouvertes.fr/tel-03284370/document
https://tel.archives-ouvertes.fr/tel-03284370/document
Autor:
Olimpieri, Federico
Publikováno v:
Mathematics [math]. Aix-Marseille Université, 2020. English. ⟨NNT : ⟩
This thesis studies the notion of approximation in lambda-calculus from differentperspectives.Ehrhard and Regnier introduced the Taylor expansion of lambda-terms: onecan see a lambda-term as an infinite formal sum of its linear approximants. Another
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6aa433e836f993b884fc227c4e247e65
https://theses.hal.science/tel-03123485
https://theses.hal.science/tel-03123485
Autor:
Barenbaum, Pablo
Publikováno v:
Logic in Computer Science [cs.LO]. Universidad de Buenos Aires, 2020. English
Explicit substitution calculi are variants of the lambda-calculus in which the operation of substitution is not defined at the metalanguage level, but rather implemented by means of rewriting rules. Our main object of study is a particular explicit s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::370566e8093d4871ab7652509649e4ba
https://hal.archives-ouvertes.fr/tel-03415346
https://hal.archives-ouvertes.fr/tel-03415346
Autor:
De Visme, Marc
Publikováno v:
Logic in Computer Science [cs.LO]. Université de Lyon, 2020. English. ⟨NNT : 2020LYSEN056⟩
In this thesis, we study quantum programming languages, and focus on the quantum lambda-calculus, a paradigmatic language defined by Selinger and Valiron, which mixes a rich classical control flow (higher order functions, etc.) and quantum data (qubi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::6f1c8fda4863b5e0de0f16e6e87d338e
https://theses.hal.science/tel-03045844/file/DE_VISME_Marc_2020LYSEN056_These.pdf
https://theses.hal.science/tel-03045844/file/DE_VISME_Marc_2020LYSEN056_These.pdf
Autor:
Olimpieri, Federico
Publikováno v:
Mathematics [math]. Aix-Marseille Université, 2020. English
This thesis studies the notion of approximation in lambda-calculus from differentperspectives.Ehrhard and Regnier introduced the Taylor expansion of lambda-terms: onecan see a lambda-term as an infinite formal sum of its linear approximants. Another
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::14fe7553e74ca1d4d89ef3115fdbadd0
https://theses.hal.science/tel-03123485
https://theses.hal.science/tel-03123485
Autor:
Stolze, Claude
Publikováno v:
Logic [math.LO]. COMUE Université Côte d'Azur (2015-2019), 2019. English. ⟨NNT : 2019AZUR4104⟩
The subject of this thesis is about lambda-calculus decorated with types, usually called "Church-style typed lambda-calculus". We study this lambda-calculus enhanced with Intersection types, as described by Barendregt, Dekkers and Statman in the book
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______212::1d6dc1bf817b9f20ac6fb22f13eed385
https://hal.archives-ouvertes.fr/tel-02406953v2/document
https://hal.archives-ouvertes.fr/tel-02406953v2/document
Autor:
Stolze, Claude
Publikováno v:
Logic [math.LO]. COMUE Université Côte d'Azur (2015-2019), 2019. English. ⟨NNT : 2019AZUR4104⟩
The subject of this thesis is about lambda-calculus decorated with types, usually called "Church-style typed lambda-calculus". We study this lambda-calculus enhanced with Intersection types, as described by Barendregt, Dekkers and Statman in the book
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::1d6dc1bf817b9f20ac6fb22f13eed385
https://hal.science/tel-02406953
https://hal.science/tel-02406953