From type checking by recursive descent to type checking with an abstract machine

Sergey, Ilya; Clarke, Dave

doi:10.1145/1988783.1988785

Cited by 5 publications

(2 citation statements)

References 30 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Second, we have introduced abstract rewriting as a simple yet powerful technique for deriving tools from a language's semantics. We are excited by the idea of using it to derive other artifacts from language semantics, such as a symbol-table generator from the typing abstract-machine [Sergey and Clarke 2011].…”

Section: Discussionmentioning

confidence: 99%

Automatically Deriving Control-Flow Graph Generators from Operational Semantics

Koppel,

Kearl,

Solar-Lezama

2020

Preprint

View full text Add to dashboard Cite

We develop the first theory of control-flow graphs from first principles, and use it to create an algorithm for automatically synthesizing many variants of control-flow graph generators from a language's operational semantics. Our approach first introduces a new algorithm for converting a large class of small-step operational semantics to an abstract machine. It next uses a technique called "abstract rewriting" to automatically abstract the semantics of a language, which is used both to directly generate a CFG from a program ("interpreted mode") and to generate standalone code, similar to a human-written CFG generator, for any program in a language. We show how the choice of two abstraction and projection parameters allow our approach to synthesize several families of CFG-generators useful for different kinds of tools. We prove the correspondence between the generated graphs and the original semantics. We provide and prove an algorithm for automatically proving the termination of interpreted-mode generators. In addition to our theoretical results, we have implemented this algorithm in a tool called Mandate, and show that it produces human-readable code on two medium-size languages with 60 − 80 rules, featuring nearly all intraprocedural control constructs common in modern languages. We then showed these CFG-generators were sufficient to build two static analysers atop them. Our work is a promising step towards the grand vision of being able to synthesize all desired tools from the semantics of a programming language.

show abstract

Section: Discussionmentioning

confidence: 99%

Automatically Deriving Control-Flow Graph Generators from Operational Semantics

Koppel,

Kearl,

Solar-Lezama

2020

Preprint

View full text Add to dashboard Cite

show abstract

“…Typing environments TEnv represent bindings of identifiers to types, which are values in the hybrid language. In order to keep to the uniform approach for different semantics for type inference [18], we leave environments parametrized by the type parameter 'a, which is instantiated with typ in this case.…”

Section: Abstract Syntax Of λ H : Closures and Valuesmentioning

confidence: 99%

A correspondence between type checking via reduction and type checking via evaluation

Sergey

Clarke

2012

Information Processing Letters

Self Cite

View full text Add to dashboard Cite

We describe a derivational approach to proving the equivalence of different representations of a type system. Different ways of representing type assignments are convenient for particular applications such as reasoning or implementation, but some kind of correspondence between them should be proven. In this paper we address two such semantics for type checking: one, due to Kuan et al., in the form of a term rewriting system and the other in the form of a traditional set of derivation rules. By employing a set of techniques investigated by Danvy et al., we mechanically derive the correspondence between a reductionbased semantics for type-checking and a traditional one in the form of derivation rules, implemented as a recursive descent. The correspondence is established through a series of semantics-preserving functional program transformations.

show abstract

Demystifying dependence

Koppel

Jackson

2020

Proceedings of the 2020 ACM SIGPLAN International Symposium on New Ideas, New Paradigms, and Reflections on Programming and Sof

View full text Add to dashboard Cite

From type checking by recursive descent to type checking with an abstract machine

Cited by 5 publications

References 30 publications

Automatically Deriving Control-Flow Graph Generators from Operational Semantics

Automatically Deriving Control-Flow Graph Generators from Operational Semantics

A correspondence between type checking via reduction and type checking via evaluation

Demystifying dependence

Contact Info

Product

Resources

About