Proofs and types
Deforestation: transforming programs to eliminate trees
Proceedings of the Second European Symposium on Programming
Type inference for record concatenation and multiple inheritance
Information and Computation
Synchronous programming with events and relations: the SIGNAL language and its semantics
Science of Computer Programming
Report on the programming language Haskell: a non-strict, purely functional language version 1.2
ACM SIGPLAN Notices - Haskell special issue
Type inference for records in natural extension of ML
Theoretical aspects of object-oriented programming
Proving the correctness of reactive systems using sized types
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Type-based analysis of uncaught exceptions
ACM Transactions on Programming Languages and Systems (TOPLAS)
Structural Recursive Definitions in Type Theory
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
A Synchronous Semantics of Higher-Order Processes for Modeling Reconfigurable Reactive Systems
Proceedings of the 18th Conference on Foundations of Software Technology and Theoretical Computer Science
Constructive Analysis of Cyclic Circuits
EDTC '96 Proceedings of the 1996 European conference on Design and Test
| Hi-index | 0.00 |
This article presents a causality analysis for a synchronous stream language with higher-order functions. This analysis takes the shape of a type system with rows. Rows were originally designed to add extensible records to the ML type system (Didier RÉmy, Mitchell Wand). We also restate briefly the coiterative semantics for synchronous streams (Paul Caspi, Marc Pouzet), and prove the correctness of our analysis with respect to this semantics.