Chucky Ellison - Academia.edu (original) (raw)

Uploads

Papers by Chucky Ellison

Meseguer and Rosu [MR04,MR07] proposed rewriting logic semantics (RLS) as a programing language d... more Meseguer and Rosu [MR04,MR07] proposed rewriting logic semantics (RLS) as a programing language definitional framework that unifies operational and algebraic denotational semantics. Once a language is defined as an RLS theory, many generic tools are immediately available for use with no additional cost to the designer. These include a formal inductive theorem proving environment, an efficient interpreter, a state space explorer, and even a model checker. RLS has already been used to define a series of didactic and real languages [MR04, MR07], but its benefits in connection with defining and reasoning about type systems have not been fully investigated yet. This paper shows how the same RLS style employed for giving formal definitions of languages can be used to define type systems. The same term-rewriting mechanism used to execute RLS language definitions can now be used to execute type systems, giving type checkers or type inferencers. Since both the language and its type system ar...

$Research paper thumbnail of Executing Formal Semantics with the <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi mathvariant="double-struck">K</mi></mrow><annotation encoding="application/x-tex">\mathbb K</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.6889em;"></span><span class="mord mathbb">K</span></span></span></span> Tool$

Lecture Notes in Computer Science, 2012

Electronic Notes in Theoretical Computer Science, 2014

Lecture Notes in Computer Science, 2012

Lecture Notes in Computer Science, 2009

Lecture Notes in Computer Science, 2011

ACM SIGPLAN Notices, 2012

Proceedings of the 33rd ACM SIGPLAN conference on Programming Language Design and Implementation - PLDI '12, 2012

Meseguer and Rosu [MR04,MR07] proposed rewriting logic semantics (RLS) as a programing language d... more Meseguer and Rosu [MR04,MR07] proposed rewriting logic semantics (RLS) as a programing language definitional framework that unifies operational and algebraic denotational semantics. Once a language is defined as an RLS theory, many generic tools are immediately available for use with no additional cost to the designer. These include a formal inductive theorem proving environment, an efficient interpreter, a state space explorer, and even a model checker. RLS has already been used to define a series of didactic and real languages [MR04, MR07], but its benefits in connection with defining and reasoning about type systems have not been fully investigated yet. This paper shows how the same RLS style employed for giving formal definitions of languages can be used to define type systems. The same term-rewriting mechanism used to execute RLS language definitions can now be used to execute type systems, giving type checkers or type inferencers. Since both the language and its type system ar...

$Research paper thumbnail of Executing Formal Semantics with the <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi mathvariant="double-struck">K</mi></mrow><annotation encoding="application/x-tex">\mathbb K</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.6889em;"></span><span class="mord mathbb">K</span></span></span></span> Tool$

Lecture Notes in Computer Science, 2012

Electronic Notes in Theoretical Computer Science, 2014

Lecture Notes in Computer Science, 2012

Lecture Notes in Computer Science, 2009

Lecture Notes in Computer Science, 2011

ACM SIGPLAN Notices, 2012

Proceedings of the 33rd ACM SIGPLAN conference on Programming Language Design and Implementation - PLDI '12, 2012

Log In