Revised5 Report on the Algorithmic Language Scheme

By Richard Kelsey, William D. Clinger, Jonathan Rees. 1986

Subfields: Automated Theorem Proving & Formal Methods

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Automated Theorem Proving & Formal Methods

1. David Huynh
2. David R Karger
3. Dennis Quan

Citations in the corpus

• Haystack: A Platform for Authoring End User Semantic Web Applications (2003, methodology): “Adenine adopts a combination of Python, Notation3, and Scheme [ 9 ] syntax in order to conveniently express frequently-used RDF operations.”
• Revised6 Report on the Algorithmic Language Scheme (2009, background): “Another revision published in 1998, edited by Richard Kelsey, Will Clinger and Jonathan Rees, reflected further revisions agreed upon in a meeting at Xerox PARC in June 1992 [21].”
• Verification and change-impact analysis of access-control policies (2005, methodology): “(We use traditional rather than Scheme notation for the benefit of the parenthetically-challenged.) stu-asn-ext = avc-u ( make-avc (role, Student ), make-avc (resource, ExternalGrades ), make-avc (action, Assign )) perm-requests = restrict-to-dec ( policy , permit) perm-stu-asn-ext = avc-u ( perm-req”
• Polyglot: An Extensible Compiler Framework for Java (2003, background): “This feature provides many of the benefits of quasiquoting in Scheme [19].”