Zobrazeno 1 - 10
of 52
pro vyhledávání: '"Higher-order languages"'
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:
Logical Methods in Computer Science
Logical Methods in Computer Science, 2021, Volume 17, Issue 3, ⟨10.46298/lmcs-17(3:25)2021⟩
Logical Methods in Computer Science, Logical Methods in Computer Science Association, 2021, Volume 17, Issue 3, ⟨10.46298/lmcs-17(3:25)2021⟩
Logical Methods in Computer Science, 2021, Volume 17, Issue 3, ⟨10.46298/lmcs-17(3:25)2021⟩
Logical Methods in Computer Science, Logical Methods in Computer Science Association, 2021, Volume 17, Issue 3, ⟨10.46298/lmcs-17(3:25)2021⟩
International audience; The bisimulation proof method can be enhanced by employing `bisimulations up-to' techniques. A comprehensive theory of such enhancements has been developed for first-order (i.e., CCS-like) labelled transition systems (LTSs) an
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::eaf1171150e2903d39cc3296850b0f3e
https://hal.science/hal-03350199
https://hal.science/hal-03350199
Autor:
Valeria Vignudelli, Davide Sangiorgi
Publikováno v:
POPL '16
POPL '16, Jan 2016, St. Petersburg, United States. ⟨10.1145/2837614.2837651⟩
POPL
POPL '16, Jan 2016, St. Petersburg, United States. ⟨10.1145/2837614.2837651⟩
POPL
Environmental bisimulations for probabilistic higher-order languages are studied. In contrast with applicative bisimulations, environmental bisimulations are known to be more robust and do not require sophisticated techniques such as Howe’s in the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::33b1c3e4ba484a583d8e30122f794de5
https://doi.org/10.1145/3350618
https://doi.org/10.1145/3350618
Publikováno v:
Proceedings of the ACM on Programming Languages
Proceedings of the ACM on Programming Languages, ACM, 2020, pp.1-29. ⟨10.1145/3371099⟩
Proceedings of the ACM on Programming Languages, 2020, pp.1-29. ⟨10.1145/3371099⟩
Proceedings of the ACM on Programming Languages, ACM, 2020, pp.1-29. ⟨10.1145/3371099⟩
Proceedings of the ACM on Programming Languages, 2020, pp.1-29. ⟨10.1145/3371099⟩
In this work, we study 'reduction monads', which are essentially the same as monads relative to the free functor from sets into multigraphs. Reduction monads account for two aspects of the lambda calculus: on the one hand, in the monadic viewpoint, t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3acf2e86072a12291cbeed6bbe47e352
http://arxiv.org/abs/1911.06391
http://arxiv.org/abs/1911.06391
Autor:
Laurenz Hudetz
Publikováno v:
Synthese. 196:1131-1149
Several philosophers of science construe models of scientific theories as set-theoretic structures. Some of them moreover claim that models should not be construed as structures in the sense of model theory because the latter are language-dependent.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::001a6c417046e01ae861bf91392872ac
https://doi.org/10.1007/s11229-017-1502-0
https://doi.org/10.1007/s11229-017-1502-0
Autor:
Eduardo Alejandro Barrio
Publikováno v:
CONICET Digital (CONICET)
Consejo Nacional de Investigaciones Científicas y Técnicas
instacron:CONICET
Consejo Nacional de Investigaciones Científicas y Técnicas
instacron:CONICET
The aim of this paper is to investigate various limiting results about the concept of validity. In particular, I argue that the higher-order logic with standard semantics cannot be sufficiently expressive to capture its own concept of validity. Moreo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7af47dfcf6455a3fc7d4894c5ff1058d
https://doi.org/10.22201/iifs.18704905e.2014.544
https://doi.org/10.22201/iifs.18704905e.2014.544
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.
Autor:
Vignudelli, Valeria
Publikováno v:
Logic in Computer Science [cs.LO]. University of Bologna, 2017. English
Higher-order languages, whose paradigmatic example is the λ-calculus, are languages with powerful operators that are capable of manipulating and exchanging programs themselves. This thesis studies behavioral equivalences for programs with higher-ord
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______212::3e1131f00d6d0f72c5ab79a5bea3bbea
https://hal.inria.fr/tel-01644462/document
https://hal.inria.fr/tel-01644462/document
Autor:
Ciro De Florio
Publikováno v:
EPISTEMOLOGIA. :79-95
Logic of higher order and truth. This paper takes into account Etchemendy’s argument which critiques classic tarskian notion of logical truth and it casts light on some doubtful aspect of his approach. The focus is the extensional inadequacy of tar
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::91a94e1f9c3e2d71cf5746681e38de88
https://doi.org/10.3280/epis2014-001005
https://doi.org/10.3280/epis2014-001005