In a recursive-equations language is introduced. Its operational semantics is specified by means of computing agents which communicate and exchange messages. Those communications are, so to speak, zero-order, in the sense that the exchanged messages are values of a data structure, possibly defined
โฆ LIBER โฆ
Definitional Interpreters for Higher-Order Programming Languages
โ Scribed by John C. Reynolds
- Book ID
- 110285148
- Publisher
- Springer
- Year
- 1998
- Tongue
- English
- Weight
- 154 KB
- Volume
- 11
- Category
- Article
- ISSN
- 1388-3690
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Higher-order communications for concurre
โ
Alberto Pettorossi; Andrzej Skowron
๐
Article
๐
1984
๐
Elsevier Science
๐
English
โ 359 KB
Higher-Order Types and Meta-Programming
โ
G. Ferrari; E. Moggi; R. Pugliese
๐
Article
๐
2002
๐
Elsevier Science
๐
English
โ 201 KB
Definition of programming languages by i
โ
M. D. Atkinson
๐
Article
๐
1976
๐
John Wiley and Sons
๐
English
โ 94 KB
[Undergraduate Topics in Computer Scienc
โ
Sestoft, Peter
๐
Article
๐
2012
๐
Springer London
๐
English
โ 183 KB
Programming Language Concepts uses a functional programming language (F#) as the metalanguage in which to present all concepts and examples, and thus has an operational flavour, enabling practical experiments and exercises. It includes basic concepts such as abstract syntax, interpretation, stack ma
Higher-order duality for nondifferentiab
โ
Anurag Jayswal; Ioan Stancu-Minasian
๐
Article
๐
2011
๐
Elsevier Science
๐
English
โ 240 KB
Interior-point methods for nonconvex non
โ
David F. Shanno; Robert J. Vanderbei
๐
Article
๐
2000
๐
Springer-Verlag
๐
English
โ 114 KB