Resolving quartz overloading

Authors:
Oliver Pell;Wayne Luk
Affiliations:
Department of Computing, Imperial College, London, UK;Department of Computing, Imperial College, London, UK
Venue:
CHARME'05 Proceedings of the 13 IFIP WG 10.5 international conference on Correct Hardware Design and Verification Methods
Year:
2005

Citing 3
Cited 0

How to make ad-hoc polymorphism less ad hoc

POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A Machine-Oriented Logic Based on the Resolution Principle

Journal of the ACM (JACM)
Pebble: A Language for Parametrised and Reconfigurable Hardware Design

FPL '98 Proceedings of the 8th International Workshop on Field-Programmable Logic and Applications, From FPGAs to Computing Paradigm

Quantified Score

Hi-index	0.00

Visualization

Abstract

Quartz is a new declarative hardware description language with polymorphism, overloading, higher-order combinators and a relational approach to data flow, supporting formal reasoning for design verification in the same style as the Ruby language. The combination of parametric polymorphism and overloading within the language involves the implementation of a system of constrained types. This paper describes how Quartz overloading is resolved using satisfiability matrix predicates. Our algorithm is a new approach to overloading designed specifically for the requirements of describing hardware in Quartz.