Names, Equations, Relations: Practical Ways to Reason about new

The nu-calculus of Pitts and Stark is a typed lambdacalculus, extended with state in the form of dynamically-generated names. These names can be created locally, passed around, and compared with one another. Through the interaction between names and functions, the language can capture notions of scope, visibility and sharing. Originally motivated by the study of references in Standard ML, the nu-calculus has connections to other kinds of local declaration, and to the mobile processes of the π-calculus.

[1]  Ian David Bede Stark,et al.  Names and higher-order functions , 1994 .

[2]  Carolyn L. Talcott,et al.  A Variable Typed Logic of Effects , 1995, Inf. Comput..

[3]  C. Talcott,et al.  Reasoning about functions with effects , 1999 .

[4]  Thore Husfeldt,et al.  Hardness Results for Dynamic Problems by Extensions of Fredman and Saks' Chronogram Method , 1998, ICALP.

[5]  Ian A. Mason,et al.  A Variable Typed Logic of E ects , 1993 .

[6]  Devdatt P. Dubhashi,et al.  Negative dependence through the FKG Inequality , 1996 .

[7]  Lars Arge,et al.  The I/O - Complexity of Ordered Binary - Decision Diagram Manipulation , 1995, ISAAC.

[8]  Andrew Donald Gordon,et al.  Functional programming and input/output , 1995 .

[9]  Luca Cardelli,et al.  Mobile Ambients , 1998, Foundations of Software Science and Computation Structure.

[10]  I. Stark,et al.  Operational reasoning for functions with local state , 1999 .

[11]  Kim G. Larsen,et al.  Formal modeling and analysis of an audio/video protocol: an industrial case study using UPPAAL , 1997, Proceedings Real-Time Systems Symposium.

[12]  Andrew M. Pitts,et al.  Observable Properties of Higher Order Functions that Dynamically Create Local Names, or What's new? , 1993, MFCS.

[13]  Robin Milner,et al.  A Calculus of Mobile Processes, II , 1992, Inf. Comput..

[14]  Ian A. Mason.  The Semantics of Destructive LISP , 1986 .

[15]  Alessandro Panconesi,et al.  Fast Distributed Algorithms for Brooks-Vizing Colourings (Extended Abstract) , 1997 .

[16]  Davide Sangiorgi,et al.  Bisimulation for Higher-Order Process Calculi , 1994, Inf. Comput..

[17]  Eugenio Moggi,et al.  A general semantics for Evaluation Logic , 1994, Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science.

[18]  Lawrence Charles Paulson,et al.  Isabelle: A Generic Theorem Prover , 1994 .

[19]  Glynn Winskel,et al.  A theory of recursive domains with applications to concurrency , 1997, Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.98CB36226).

[20]  Ian Stark.  Categorical models for local names , 1996, LISP Symb. Comput..

[21]  Andrew M. Pitts,et al.  Higher order operational techniques in semantics , 1999 .

[22]  Andrew D. Gordon.  Bisimilarity as a theory of functional programming , 1995, MFPS.

[23]  Eugenio Moggi,et al.  Notions of Computation and Monads , 1991, Inf. Comput..

[24]  Arne Skou,et al.  Modelling and analysis of a collision avoidance protocol using Spin and Uppaal , 1996, The Spin Verification System.

[25]  Desh Ranjan,et al.  Balls and bins: A study in negative dependence , 1996, Random Struct. Algorithms.

[26]  Eugenio Moggi.  Representing Program Logics in Evaluation Logic , 1994 .

[27]  Martín Abadi,et al.  A calculus for cryptographic protocols: the spi calculus , 1997, CCS '97.

[28]  Carolyn L. Talcott,et al.  Inferring the Equivalence of Functional Programs That Mutate Data , 1992, Theor. Comput. Sci..

[29]  Robin Milner,et al.  A Calculus of Mobile Processes, II , 1992, Inf. Comput..

[30]  Robin Milner,et al.  Definition of standard ML , 1990 .

[31]  Robert Hieb,et al.  The Revised Report on the Syntactic Theories of Sequential Control and State , 1992, Theor. Comput. Sci..

[32]  Lars Arge,et al.  The Buuer Tree: a New Technique for Optimal I/o-algorithms ? , 1995 .

[33]  Gonzalo E. Reyes,et al.  A Note on Frame Distributions , 1997 .

[34]  Glynn Winskel,et al.  Relational Semantics of Non-Deterministic Dataflow , 1997 .

[35]  Hugo Herbelin,et al.  The Coq proof assistant : reference manual, version 6.1 , 1997 .

[36]  I. Stark,et al.  On the Observable Properties of Higher Order Functions that Dynamically Create Local Names (Preliminary Report) , 1993 .

[37]  C. Talcott.  Reasoning about Functions with Eeects , 1997 .

[38]  Amr Sabry,et al.  Reasoning about programs in continuation-passing style , 1992, LFP '92.

[39]  Davide Sangiorgi,et al.  Algebraic Theories for Name-Passing Calculi , 1993, Inf. Comput..

[40]  Alessandro Panconesi,et al.  On the distributed complexity of computing maximal matchings , 1997, SODA '98.

[41]  Andrew D. Gordon,et al.  Five Axioms of Alpha-Conversion , 1996, TPHOLs.

[42]  Carolyn L. Talcott,et al.  1 Equivalence in Functional Languages with E ectsIan , 2007 .

[43]  Ian Stark.  Names, Equations, Relations: Practical Ways to Reason About New , 1998, Fundam. Informaticae.

[44]  S. Abramsky.  The lazy lambda calculus , 1990 .

[45]  Peter Bro Miltersen,et al.  Fusion Trees can be Implemented with AC0 Instructions Only , 1999, Theor. Comput. Sci..

[46]  Carolyn L. Talcott,et al.  References, local variables and operational reasoning , 1992, [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science.

[47]  References , 1971 .

[48]  Jon G. Riecke,et al.  A Complete and Decidable Proof System for Call-by-Value Equalities (Preliminary Report) , 1990, ICALP.

[49]  Douglas J. Howe.  Proving Congruence of Bisimulation in Functional Programming Languages , 1996, Inf. Comput..

[50]  Ian A. Mason,et al.  An Operational Logic of Effects , 1996 .