Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '96, 1996
Abstract By adding reflexion to the chemical machine of Berry and Boudol, we obtain a formal mode... more Abstract By adding reflexion to the chemical machine of Berry and Boudol, we obtain a formal model of concurrency that is consistent with mobility and distribution. Our model provides the foundations of a programming language with functional and object-oriented ...
In this paper, we present an approach to describe uniformly iterated “big” operations, like å&... more In this paper, we present an approach to describe uniformly iterated “big” operations, like å</font >i=0n f(i)\sum_{i=0}^n f(i) or max i ∈ I f(i) and to provide lemmas that encapsulate all the commonly used reasoning steps on these constructs. We show that these iterated operations can be handled generically using the syntactic notation and canonical structure facilities provided by the Coq system.
... in the Coq1 ring, or romega): they are generated on-the-fly by some heuristic algorithm and d... more ... in the Coq1 ring, or romega): they are generated on-the-fly by some heuristic algorithm and directlyfed to some ... Many of the basic tactics, such as intros, induction and inversion, implement fragile context manipulation heuristics which hinder ... presentation: generator and relation ...
Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '96, 1996
Abstract By adding reflexion to the chemical machine of Berry and Boudol, we obtain a formal mode... more Abstract By adding reflexion to the chemical machine of Berry and Boudol, we obtain a formal model of concurrency that is consistent with mobility and distribution. Our model provides the foundations of a programming language with functional and object-oriented ...
In this paper, we present an approach to describe uniformly iterated “big” operations, like å&... more In this paper, we present an approach to describe uniformly iterated “big” operations, like å</font >i=0n f(i)\sum_{i=0}^n f(i) or max i ∈ I f(i) and to provide lemmas that encapsulate all the commonly used reasoning steps on these constructs. We show that these iterated operations can be handled generically using the syntactic notation and canonical structure facilities provided by the Coq system.
... in the Coq1 ring, or romega): they are generated on-the-fly by some heuristic algorithm and d... more ... in the Coq1 ring, or romega): they are generated on-the-fly by some heuristic algorithm and directlyfed to some ... Many of the basic tactics, such as intros, induction and inversion, implement fragile context manipulation heuristics which hinder ... presentation: generator and relation ...
Uploads