An operational semantics framework supporting the incremental construction of derivation trees

Electronic Notes in Theoretical Computer Science

Volumn 10, Issue , 1998, Pages 122-133

  Stoughton, Allen ^a  

^a Sunflower Networking Group   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER PROGRAMMING LANGUAGES; COMPUTER SCIENCE; FUNCTIONS; PROBLEM SOLVING; TREES (MATHEMATICS);

INTEGERS; LAMBDA CALCULUS; METALANGUAGES; OPERATIONAL SEMANTICS;

SEMANTICS;

EID: 19144363748     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(05)80693-0     Document Type: Conference Paper

References (7)

1. Berry D. Generating Program Animators from Programming Language Semantics. 1991;PhD thesis, Edinburgh University
2. Cousot P., Cousot R. Abstract interpretation: a unified lattice model for static analysis of programs. In Proc. 4th ACM Symp. on Principles of Programming Languages. 1977;238-252 ACM Press
3. Cousot P., Cousot R. Inductive definitions, semantics, and abstract interpretation. In Proc. 19th ACM Symp. on Principles of Programming Languages. 1992;83-94 ACM Press
4. Deransart P., Ferrand G. An operational formal definition of PROLOG. In Proc. IEEE Symp. on Logic Programming. 1987;162-172 IEEE Press
5. Glück R., Sørensen M.H. A roadmap to metacomputation by supercompilation. Danvy O., Glück R., Thiemann P. Partial Evaluation, number 1110 in Lecture Notes in Computer Science. 1996;137-160 Springer-Verlag
6. Gunter C., Rémy D. A proof-theoretic assessment of runtime type errors. Technical memo 11261-921230-43TM. 1993;AT&T Bell Laboratories, Murray Hill, PA
7. H. Ibraheem and D. Schmidt. Partial evaluation of higher-order natural-semantics derivations. In M. Leuschel, editor, Proc. Workshop on Specialization of Declarative Programs and its Applications, Port Jefferson, NY.http://www.cis.ksu.edu/~schmidt/papers/driving.ps.Z, 1997.