A Reflective Higher-order Calculus

Meredith, L. G.; Radestock, Matthias

doi:10.1016/j.entcs.2005.05.016

Cited by 17 publications

(12 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Propositions 5.3 and 5.6). This encoding is relevant in a broader setting, as known encodings of name-passing into higher-order calculi [42,2,24,47,49] require limitations in source/target languages, do not consider types, and/or fail to satisfy strong encodability criteria (see below). We also showed that HO can encode HOπ and its extension with higher-order applications (HOπ + ).…”

Section: Related Workmentioning

confidence: 99%

“…Other related works are [2,24,47,21]. The paper [2] gives a fully abstract encoding of the π -calculus into Homer, a higher-order calculus with explicit locations, local names, and nested locations.…”

Section: Related Workmentioning

confidence: 99%

“…The paper [2] gives a fully abstract encoding of the π -calculus into Homer, a higher-order calculus with explicit locations, local names, and nested locations. The paper [24] presents a reflective calculus with a "quoting" operator: names are quoted processes and represent the code of a process; name-passing is then a way of passing the code of a process. This reflective calculus can encode both first-and higher-order π -calculus.…”

Section: Related Workmentioning

confidence: 99%

See 2 more Smart Citations

On the relative expressiveness of higher-order session processes

Kouzapas

Pérez

Yoshida

2019

Information and Computation

View full text Add to dashboard Cite

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

On the relative expressiveness of higher-order session processes

Kouzapas

Pérez

Yoshida

2019

Information and Computation

View full text Add to dashboard Cite

“…2) RHOLANG: is a functional, concurrent, based on rho-calculus [47] language [67], used in project RCHAIN. A smart contract in terms of RCHAIN is a process, which has persistent state, its own code, and associated address.…”

Section: Intermediate-level Languagesmentioning

confidence: 99%

Overview of the Languages for Safe Smart Contract Programming

Тюрин¹,

Тюляндин²,

Мальцев³

et al. 2019

Proceedings of ISP RAS

View full text Add to dashboard Cite

Blockchain technologies are gradually being found an application in many areas, especially in FinTech. As a result, a lot of blockchain platforms have emerged with the support of smart contracts that are intended to automate party interactions. However, it has been shown that they are prone to attacks and errors which lead to money loss. To date, there has been a wide range of approaches for making smart contracts safer that included analysis tools, reasoning models, and safer and more rigorous programming languages. In this paper, we provide an overview of smart contract programming languages design principles, related vulnerabilities, and future research areas. The provided overview is meant to outline the to date state of languages and to become a possible basis for future proceedings, and show approaches, used by the community, to reach safe and usable language for smart contracts. We have split all found vulnerabilities by source of their arising. Various languages' characteristics such as abstraction level, paradigm, Turing completeness and main features are summarized in the table. Additional information about languages is provided, e.g. model of execution and tools for static analysis.

show abstract

“…2, the angle between the polar radius and the tangent of the pitch curve of the workpiece is μ. From the theory of calculus [11], we can infer the following. (2)…”

Section: Profile-linkage Modelsmentioning

confidence: 99%