A functional language for description and design of digital systems: sequential constructs

Authors:
F. Meshkinpour;M. D. Ercegovac
Affiliations:
Perceptronics Inc., 6271 Variel Ave., Woodland, Hills, CA and Computer Science Department, University of California at Los Angeles, Los Angeles, CA;Computer Science Department, University of California at Los Angeles, Los Angeles, CA
Venue:
DAC '85 Proceedings of the 22nd ACM/IEEE Design Automation Conference
Year:
1985

Citing 7
Cited 3

Digital systems and hardware/firmware algorithms

Digital systems and hardware/firmware algorithms
Can programming be liberated from the von Neumann style?: a functional style and its algebra of programs

Communications of the ACM
Synthesis of Digital Design from Recursive Equations

Synthesis of Digital Design from Recursive Equations
Switching and Finite Automata Theory: Computer Science Series

Switching and Finite Automata Theory: Computer Science Series
Digital Systems with Algorithm Implementation

Digital Systems with Algorithm Implementation
Introduction to VLSI Systems

Introduction to VLSI Systems
muFP, a language for VLSI design

LFP '84 Proceedings of the 1984 ACM Symposium on LISP and functional programming

ODM: an object oriented data model for design databases

CSC '86 Proceedings of the 1986 ACM fourteenth annual conference on Computer science
Functional netlists

Proceedings of the 13th ACM SIGPLAN international conference on Functional programming
A calculus for hardware description*

Journal of Functional Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

A functional (applicative) hardware description language (FHDL), capable of dealing with both the sequential and combinational systems is discussed. The language supports multi-level executable specifications and interpretation of functional specifications as implementations at a given level of primitives. That is, the FHDL specifications are symbolically interpreted to produce structural representations (implementations) of hardware algorithms. The symbolic interpreter presently implements the specification of hardware algorithms at the gate level. The FHDL allows definition of function attributes, such as delay and number of logic level so that the performance characteristics of implementations can be obtained during simulation.