Observable sharing for functional circuit description

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1742, Issue , 1999, Pages 62-73

  Claessen, Koen ^a   Sands, David ^a  

^a CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; PROBLEM ORIENTED LANGUAGES; PROBLEM SOLVING; PROGRAM COMPILERS; RECONFIGURABLE HARDWARE; SEMANTICS; TREES (MATHEMATICS);

CIRCUIT SPECIFICATIONS; CYCLIC STRUCTURES; EQUALITY TESTS; FUNCTIONAL CIRCUITS; LAZY FUNCTIONAL LANGUAGES; PROGRAM TRANSFORMATIONS; SEMANTIC PROPERTIES; STANDARD PROBLEMS;

FUNCTIONAL PROGRAMMING;

EID: 84958774273     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46674-6_7     Document Type: Conference Paper

References (20)

1. Z. Ariola, M. Felleisen, J. Maraist, M. Odersky, and P. Wadler. A call-byneed lambda calculus. In Proc. POPL'95, ACM Press, 1995
2. Z. M. Ariola and A. Sabry. Correctness of monadic state: An imperative call-by-need calculus. In Proc. POPL'98, pages 62-74. ACM Press, 1998
3. P. Bjesse, K. Claessen, M. Sheeran, and S. Singh. Lava: Hardware design in Haskell. In ICFP'98. ACM Press, 1998
4. B. Cook, J. Launchbury, and J. Matthews. Specifying superscalar microprocessors in Hawk. In Formal Techniques for Hardware and Hardware-like Systems. Marstrand, Sweden, 1998
5. Matthias Felleisen and Robert Hieb. The revised report on the syntactic theories of sequential control and state. TCS, 103:235-271, 1992
6. Paul Hudak. Building domain-specific embedded languages. ACM Computing Surveys, 28(4):196, December 1996
7. J. Launchbury. A natural semantics for lazy evaluation. In Proc. POPL'93, pages 144-154. ACM Press, 1993
8. R. Milner. Fully abstract models of the typed µ-calculus. TCS 4:1-22, 1977
9. Andrew Moran and David Sands. Improvement in a lazy context: An operational theory for call-by-need. In Proc. POPL'99, ACM Press, 1999
10. I. Mason and C. Talcott. Equivalence in functional languages with effects. Journal of Functional Programming, 1(3):287-327, July 1991
11. J. O'Donnell. Generating netlists from executable circuit specifications in a pure functional language. In Functional Programming Glasgow, Springer-Verlag Workshops in Computing, pages 178-194, 1993
12. J. O'Donnell. From transistors to computer architecture: Teaching functional circuit specification in Hydra. In Functional Programming Lan-guagues in Education, LNCS vol 1125, pages 221-234. Springer Verlag, 1996
13. Martin Odersky. A functional theory of local names. In POPL'94, pages 48-59, ACM Press, 1994
14. A. M. Pitts. Reasoning about local variables with operationally-based logical relations. In 11th Annual Symposium on Logic in Computer Science, pages 152-163. IEEE Computer Society Press, 1996
15. S. Peyton Jones, W. Partain, and A. Santos. Let-floating: moving bindings to give faster programs. In Proc. ICFP'96, pages 1-12. ACM Press, 1996
16. S. Peyton Jones and A. Santos. A transformation-based optimiser for Haskell. Science of Computer Programming, 32(1-3):3-47, 1998
17. A. M. Pitts and I. D. B. Stark. Observable properties of higher order functions that create local names, or: What's new? In MFCS'93, LNCS vol 711, pages 122-141, Springer-Verlag, 1993
18. P. Sestoft. Deriving a lazy abstract machine. Journal of Functional Pro-gramming, 7(3):231-264, May 1997
19. M. Sheeran. Designing regular array architectures using higher order functions. In FPCS'95, LNCS vol 201, Springer Verlag, 1985
20. P. Wadler. Monads for Functional Programming. In Lecture notes for Marktoberdorf Summer School on Program Design Calculi, NATO ASI Series F: Computer and systems sciences. Springer Verlag, August 1992.