Transformational Rewriting with Ruby

Sharp, Robin; Rasmussen, Ole

doi:10.1016/b978-0-444-81641-2.50024-1

Cited by 11 publications

(8 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A VHDL translator was created by Sandum, Møller, Sharp, and Rasmussen [40,41]. Sharp and Rasmussen also wrote a transformational rewriting system [42,43]. The derivation of functional programs from Ruby was investigated by Hutton [37,44,45].…”

Section: Sticks and Stones Cardelli And Plotkinmentioning

confidence: 99%

See 1 more Smart Citation

A Short Historical Survey of Functional Hardware Languages

Chen¹

2012

ISRN Electronics

View full text Add to dashboard Cite

show abstract

Section: Sticks and Stones Cardelli And Plotkinmentioning

confidence: 99%

“…McPhee implemented a typed variant in λPROLOG [38]. Based on the "pure Ruby" of Rossen [46,47], Robin Sharp and his group developed T-Ruby, which has both dependent and polymorphic types [41][42][43][48][49][50]. Rasmussen formalized Ruby in Isabelle theorem prover [51,52].…”

Section: Sticks and Stones Cardelli And Plotkinmentioning

confidence: 99%

A Short Historical Survey of Functional Hardware Languages

Chen¹

2012

ISRN Electronics

View full text Add to dashboard Cite

show abstract

“…A design is derived from an abstract specification in Ruby by applying a number of correctness preserving transformations until a design, only expressed in terms of implementable relations, is reached. This method is widely used in work with Ruby and is demonstrated in for example [4,10,8,2]. The transformations are equalities or conditional equalities expressing general facts about relations and their combination and are typically resused from one design to an other.…”

Section: Introductionmentioning

confidence: 99%

Ensuring Correctness of Ruby Transformations

Rasmussen

1996

Electronic Workshops in Computing

View full text Add to dashboard Cite

Equivalence transformations are widely used in practical designs of VLSI circuits using Ruby. This paper demonstrates how proofs of these equivalences easily may be performed within a formal framework by a theorem prover. The proof tool used is called RubyZF and contains a semantical embedding of Ruby within Zermelo-Fraenkel set theory using the Isabelle theorem prover. The use of the system is exemplified by a concrete example taken from the T-Ruby design system.

show abstract

“…The language and the synthesis tools around Ruby have been developed at the Programming Research Group -Oxford, University of Glasgow and Technical University of Denmark, Lyngby [Josh90, JoSh91a,JoSh91b,ShRa93,ShRa95]. Although Ruby is only a language, we choose to call the formal synthesis approach as Ruby too.…”

Section: Rubymentioning

confidence: 99%

Formal synthesis in circuit design — A classification and survey

Kumar

Blumenröhr

Eisenbiegler

et al. 1996

Formal Methods in Computer-Aided Design

View full text Add to dashboard Cite

Abstract. This article gives a survey on different methods of formal synthesis. We define what we mean by the term formal synthesis and delimit it from the other formal methods that can also be used to guarantee the correctness of an implementation. A possible classification scheme for formal synthesis methods is then introduced, based on which some significant research activities are classified and summarized. We also briefly introduce our own approach towards the formal synthesis of hardware. Finally, we compare these approaches from different points of view.

show abstract

Transformational Rewriting with Ruby

Cited by 11 publications

References 5 publications

A Short Historical Survey of Functional Hardware Languages

A Short Historical Survey of Functional Hardware Languages

Ensuring Correctness of Ruby Transformations

Formal synthesis in circuit design — A classification and survey

Contact Info

Product

Resources

About