We propose a general, powerful framework of type systems for the -calculus, and show that we can obtain as its instances a variety of type systems guaranteeing non-trivial properties like deadlock-freedom and race-freedom. A key idea is to express types and type environments as abstract processes: W
A type system for reflective program generators
โ Scribed by Christof Lutteroth; Dirk Draheim; Gerald Weber
- Publisher
- Elsevier Science
- Year
- 2011
- Tongue
- English
- Weight
- 528 KB
- Volume
- 76
- Category
- Article
- ISSN
- 0167-6423
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
We introduce a new type system called "System ST" (ST stands for subtyping), based on subtyping, and prove the basic property of the system. We show the extraordinary expressive power of the system which leads us to think that it could be a good candidate for doing both proof and extraction of progr
Significant features are described of a Monte Carlo simulation system, LINKERS, that generates nuclear family data conforming to one locus and two loci genetic models. Software engineering techniques help to produce a user friendly environment for studies of genetic ascertainment. LINKERS 39 code mo