Towards Adding Variety to Simplicity

Nachiappan Valliappan
Nachiappan Valliappan
Solène Mirliaz
Solène Mirliaz
Elisabet Lobo Vesga
Elisabet Lobo Vesga

ISoLA, pp. 414-431, 2018.

Cited by: 0|Views9
EI

Abstract:

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

Code:

Data:

Get fulltext within 24h
Bibtex
Your rating :
0

 

Tags
Comments