Zobrazeno 1 - 10
of 10 736
pro vyhledávání: '"cs.PL"'
Autor:
Sobocinski, Pawel, Heindel, Tobias
Publikováno v:
Logical Methods in Computer Science, Volume 7, Issue 1 (April 1, 2011) lmcs:701
Colimits that satisfy the Van Kampen condition have interesting exactness properties. We show that the elementary presentation of the Van Kampen condition is actually a characterisation of a universal property in the associated bicategory of spans. T
Externí odkaz:
http://arxiv.org/abs/1101.4594
Autor:
Ehrhard, Thomas, Laurent, Olivier
Publikováno v:
Logical Methods in Computer Science, Volume 6, Issue 3 (September 1, 2010) lmcs:771
We present a restriction of the solos calculus which is stable under reduction and expressive enough to contain an encoding of the pi-calculus. As a consequence, it is shown that equalizing names that are already equal is not required by the encoding
Externí odkaz:
http://arxiv.org/abs/1007.0120
Publikováno v:
ACM Transactions on Software Engineering and Methodology. 32:1-21
Rust is an emerging programming language that aims to prevent memory-safety bugs. However, the current design of Rust also brings side effects which may increase the risk of memory-safety issues. In particular, it employs OBRM (ownership-based resour
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1f6d30ada69cfba592fcb852e1d2752a
https://doi.org/10.1145/3542948
https://doi.org/10.1145/3542948
Autor:
Smeele, Ton, Jongmans, Sung-Shik
Publikováno v:
Electronic Proceedings in Theoretical Computer Science. 378:49-60
Implementing distributed systems is hard; choreographic programming aims to make it easier. In this paper, we present the design of a new choreographic programming language that supports isolated transactions among overlapping sets of processes. The
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::718b613da8c34c26828824daa750227c
https://doi.org/10.4204/eptcs.378.5
https://doi.org/10.4204/eptcs.378.5
Publikováno v:
Electronic Proceedings in Theoretical Computer Science. 378:38-48
Brand and Zafiropulo's notion of Communicating Finite-State Machines (CFSMs) provides a succinct and powerful model of message-passing concurrency, based around channels. However, a major variant of message-passing concurrency is not readily captured
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cd8b7c54b46f4d0d61cd59bd6f218706
https://doi.org/10.4204/eptcs.378.4
https://doi.org/10.4204/eptcs.378.4
Publikováno v:
Proceedings of the ACM on Programming Languages. 7:665-695
Recursive calls over recursive data are useful for generating probability distributions, and probabilistic programming allows computations over these distributions to be expressed in a modular and intuitive way. Exact inference is also useful, but un
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2584645ca314ccb82d4f12834dfebf69
https://doi.org/10.1145/3586050
https://doi.org/10.1145/3586050
Autor:
Paul Krogmeier, P. Madhusudan
Publikováno v:
Proceedings of the ACM on Programming Languages. 7:143-171
We study expression learning problems with syntactic restrictions and introduce the class of finite-aspect checkable languages to characterize symbolic languages that admit decidable learning. The semantics of such languages can be defined using a bo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::baab74de1d92f8f277d2d143d12d16f6
https://doi.org/10.1145/3586032
https://doi.org/10.1145/3586032
Publikováno v:
Proceedings of the ACM on Programming Languages. 7:201-229
A transpiler converts code from one programming language to another. Many practical uses of transpilers require the user to be able to guide or customize the program produced from a given input program. This customizability is important for satisfyin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::21d03d57ef31b91e75d30c9d19a7e0e1
https://doi.org/10.1145/3586034
https://doi.org/10.1145/3586034
Publikováno v:
Electronic Proceedings in Theoretical Computer Science. 377:65-84
We introduce Ideograph, a language for expressing and manipulating structured data. Its types describe kinds of structures, such as natural numbers, lists, multisets, binary trees, syntax trees with variable binding, directed multigraphs, and relatio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::249bb2acbd6b4e1d0db4112c010dac95
https://doi.org/10.4204/eptcs.377.4
https://doi.org/10.4204/eptcs.377.4
Autor:
Kwon, Keehang, Kang, Daeseong
Publikováno v:
IEICE Transactions on Information and Systems. :333-336
One of the long-standing research problems on logic programming is to treat the cut predicate in a logical, high-level way. We argue that this problem can be solved by adopting linear logic and choice-disjunctive goal formulas of the form $G_0 \add G
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a848ac990d82f44fb95537784cc10434
https://doi.org/10.1587/transinf.2022fcl0001
https://doi.org/10.1587/transinf.2022fcl0001