Geometry of synthesis. IV: Compiling affine recursion into static hardware

DOI10.1145/2034773.2034805MaRDI QIDQ5176977zbMATH OpenOpenAlexFDO

Authors Dan R. Ghica, Alex I. Smith, Satnam Singh

Publication date 5 March 2015

Published in Proceedings of the 16th ACM SIGPLAN international conference on Functional programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2034773.2034805

zbMATH Keywords

affine typinggeometry of synthesisrecursion

Mathematics Subject Classification ID

Logic in computer science (03B70) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Theory of compilers and interpreters (68N20) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• Geometry of synthesis III
• Geometry of synthesis: a structured approach to VLSI design
• Geometry of synthesis. II: From games to delay-insensitive circuits
• Particle-style geometry of interaction as a module system
• Correct hardware synthesis

Cited in

(4)

• Geometry of synthesis. II: From games to delay-insensitive circuits
• Geometry of synthesis: a structured approach to VLSI design
• Semantics of higher-order quantum computation via geometry of interaction
• The dynamic geometry of interaction machine: a token-guided graph rewriter

This page was built for publication: Geometry of synthesis. IV: Compiling affine recursion into static hardware

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5176977)