Zobrazeno 1 - 10
of 50
pro vyhledávání: '"ENG, Boris"'
Autor:
Eng, Boris, Seiller, Thomas
We present the stellar resolution, a "flexible" tile system based on Robinson's first-order resolution. After establishing formal definitions and basic properties of the stellar resolution, we show its Turing-completeness and to illustrate the model,
Externí odkaz:
http://arxiv.org/abs/2207.08465
Autor:
Eng, Boris
Technically speaking, the transcendental syntax is about designing logics with a computational foundation. It suggests a new framework for proof theory where logic (proofs, formulas, truth, ...) is no more primitive but computation is. All the logica
Externí odkaz:
http://arxiv.org/abs/2012.04752
Autor:
Eng, Boris, Seiller, Thomas
We present a new asynchronous model of computation named Stellar Resolution based on first-order unification. This model of computation is obtained as a formalisation of Girard's transcendental syntax programme, sketched in a series of three articles
Externí odkaz:
http://arxiv.org/abs/2007.16077
Autor:
Juglaret, Yannis, Hritcu, Catalin, de Amorim, Arthur Azevedo, Eng, Boris, Pierce, Benjamin C.
Compartmentalization is good security-engineering practice. By breaking a large software system into mutually distrustful components that run with minimal privileges, restricting their interactions to conform to well-defined interfaces, we can limit
Externí odkaz:
http://arxiv.org/abs/1602.04503
Autor:
Eng, Boris, Seiller, Thomas
Publikováno v:
5th International Workshop on Trends in Linear Logic and Applications (TLLA 2021)
5th International Workshop on Trends in Linear Logic and Applications (TLLA 2021), Jun 2021, Rome (virtual), Italy
5th International Workshop on Trends in Linear Logic and Applications (TLLA 2021), Jun 2021, Rome (virtual), Italy
International audience; We present a gentle introduction to the technical content of Girard's Transcendental Syntax suggesting a new framework for the proof theory of linear logic and an alternative understanding of proof-nets. In this framework, we
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::6342204dda6086a6b4211e1a27e633ac
https://hal-lirmm.ccsd.cnrs.fr/lirmm-03271496/file/TLLA_2021_paper_5.pdf
https://hal-lirmm.ccsd.cnrs.fr/lirmm-03271496/file/TLLA_2021_paper_5.pdf
Autor:
Eng, Boris, Seiller, Thomas
We present a non-deterministic model of computation related to Robinson’s first-order resolution. This model formalises and extends ideas sketched by Girard in his Transcendental Syntax programme. After establishing formal defini- tions and basic p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::26e1cb1a02a442f203dd5bae2d19f416
https://hal.archives-ouvertes.fr/hal-02895111v3/file/main.pdf
https://hal.archives-ouvertes.fr/hal-02895111v3/file/main.pdf
Autor:
Eng, Boris
The stellar resolution is an asynchronous model of computation used in Girard's Transcendental Syntax which is based on Robinson's first-order clausal resolution. By using methods of realisability for linear logic, we obtain a new model of multiplica
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::52f516a6fb59f7418a6fb004bc24b336
https://hal.archives-ouvertes.fr/hal-02977750v2/file/main.pdf
https://hal.archives-ouvertes.fr/hal-02977750v2/file/main.pdf
Publikováno v:
14. Internationales Stuttgarter Symposium; 2014, p1355-1368, 14p
Autor:
ASZALOS, Attila1 ecalin@upm.ro, ENĂCHESCU, Călin1 aszi.atti@hotmail.com
Publikováno v:
Scientific Bulletin of the Petru Maior University of Targu Mures. 2013, Vol. 10 Issue 1, p28-33. 6p.