Zobrazeno 1 - 10
of 167
pro vyhledávání: '"explicit substitution"'
Autor:
Jiří Raclavský
Publikováno v:
Logic and Logical Philosophy. :1-37
The present paper offers the rule of existential generalization (EG) that is uniformly applicable within extensional, intensional and hyperintensional contexts. In contradistinction to Quine and his followers, quantification into various modal contex
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7b2574f86173f33346daa39f0c701536
https://doi.org/10.12775/llp.2021.011
https://doi.org/10.12775/llp.2021.011
Autor:
Shin-ya Nishizaki, Ryotaro Kasuga
Publikováno v:
ICSCA
The environment is the relationship between variables and their bound values during program execution and is a notion in program semantics. A first-class environment is a mechanism that allows the environment to be treated like data, such as integer
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9092bcb97db9c977166fa51c046aa444
https://doi.org/10.1145/3457784.3457798
https://doi.org/10.1145/3457784.3457798
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.
Publikováno v:
PPDP 2019-21st International Symposium on Principles and Practice of Programming Languages
PPDP 2019-21st International Symposium on Principles and Practice of Programming Languages, Oct 2019, Porto, Portugal. ⟨10.1145/3354166.3354169⟩
PPDP
PPDP 2019-21st International Symposium on Principles and Practice of Programming Languages, Oct 2019, Porto, Portugal. ⟨10.1145/3354166.3354169⟩
PPDP
International audience; Extending the λ-calculus with a construct for sharing, such as let expressions, enables a special representation of terms: iterated applications are decomposed by introducing sharing points in between any two of them, reducin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f2bcede1f56dba259666cec004ed1430
https://hal.archives-ouvertes.fr/hal-02415766/document
https://hal.archives-ouvertes.fr/hal-02415766/document
Autor:
Marcelo Fiore, Philip Saville
Publikováno v:
Fiore, M & Saville, P 2019, A type theory for cartesian closed bicategories : (Extended Abstract) . in 2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) : 24-27 June 2019-Vancouver . Institute of Electrical and Electronics Engineers (IEEE), pp. 1-13, Thirty-Fourth Annual ACM/IEEE Symposium on Logic in Computer Science, Vancouver, Canada, 24/06/19 . https://doi.org/10.1109/LICS.2019.8785708
LICS
LICS
We construct an internal language for cartesian closed bicategories. Precisely, we introduce a type theory modelling the structure of a cartesian closed bicategory and show that its syntactic model satisfies an appropriate universal property, thereby
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::33e63ff1b8118b2534de1d297edd8e3f
https://hdl.handle.net/20.500.11820/a9a7232b-27b4-4a66-908d-29ea56a72fa7
https://hdl.handle.net/20.500.11820/a9a7232b-27b4-4a66-908d-29ea56a72fa7
Autor:
Xinxin Shen, Kougen Zheng
Publikováno v:
Computer Science & Information Technology (CS & IT ).
The operation of substitution in ”3×6-calculus is treated as an atomic operation. It makes that substitution operation is complex to be analyzed. To overcome this drawback, explicit substitution systems are proposed. They bridge the gap between th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::970cd0199c291d77fdbb468e38e9d37c
https://doi.org/10.5121/csit.2019.90313
https://doi.org/10.5121/csit.2019.90313
Publikováno v:
Logic Journal of IGPL. 23:295-340
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bc971f07934ce2b2c212d8e2f6e43fd7
https://doi.org/10.1093/jigpal/jzu044
https://doi.org/10.1093/jigpal/jzu044
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 164, Iss Proc. CL&C 2014, Pp 33-47 (2014)
CL&C
CL&C
We study the lambda-mu-calculus, extended with explicit substitution, and define a compositional output-based interpretation into a variant of the pi-calculus with pairing that preserves single-step explicit head reduction with respect to weak bisimi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::74c68274469c3330b101c0f6f6a409a7
https://doaj.org/article/3bc3c474f43f44b98924d06805c32306
https://doaj.org/article/3bc3c474f43f44b98924d06805c32306
Autor:
Amelia Râştei
Publikováno v:
Electronic Notes in Theoretical Computer Science. 123:213-228
The aim of this paper is to give abstract properties of some calculi with explicit substitution which will be sufficient to prove their confluence. We define a property that we call “implementing a good notion of substitution.” We show that calcu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9932df23ea5ec420e78394e23b066b93
Autor:
Gopalan Nadathur
Publikováno v:
Electronic Notes in Theoretical Computer Science. 67:35-48
Many metalanguages and logical frameworks have emerged in recent years that use the terms of the lambda calculus as data structures. A common set of questions govern the suitability of a representation for lambda terms in the implementation of such s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0f90cdc06bb5418fa5d2167732d965ca