Geometry of synthesis: a structured approach to VLSI design
From MaRDI portal
Recommendations
Cited in
(24)- Computation by interaction for space-bounded functional programming
- A calculus for hardware description
- Coquet: a Coq library for verifying hardware
- Geometry of synthesis. II: From games to delay-insensitive circuits
- Generating reversible circuits from higher-order functional programs
- Parsimonious types and non-uniform computation
- The Calculus of Handshake Configurations
- scientific article; zbMATH DE number 3938571 (Why is no real title available?)
- Dependent types and formal synthesis
- scientific article; zbMATH DE number 1522999 (Why is no real title available?)
- Diagrammatic reasoning for delay-insensitive asynchronous circuits
- The dynamic geometry of interaction machine: a token-guided graph rewriter
- A Petri Net Model of Handshake Protocols
- Geometry of synthesis. IV: Compiling affine recursion into static hardware
- Quantitative weak linearisation
- Modeling a hardware synthesis methodology in Isabelle
- The far side of the cube. An elementary introduction to game semantics
- String diagrams for strictification and coherence
- Reasonable space for the -calculus, logarithmically
- On higher-order cryptography
- (Definitely not) boring interaction abstract machines
- Reasonable space for the -calculus, logarithmically
- Slightly nonlinear higher-order tree transducers
- Correct hardware synthesis
This page was built for publication: Geometry of synthesis: a structured approach to VLSI design
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3189816)