Towards Adding Variety to Simplicity
ISoLA, pp. 414-431, 2018.
Simplicity is a Turing-incomplete typed combinator language for smart contracts with a formal semantics. The design of Simplicity makes it possible to statically estimate the resources (e.g., memory) required to execute contracts. Such a feature is highly relevant in blockchain applications to efficiently determine fees to run smart contr...More
Full Text (Upload PDF)
PPT (Upload PPT)