Bohm-Like Trees for Rewriting

[1]  Andrew M. Pitts,et al.  A New Approach to Abstract Syntax with Variable Binding , 2002, Formal Aspects of Computing.

[2]  Bastiaan Heeren,et al.  Top quality type error Messages , 2005 .

[3]  J. Blanco.  Definability with the State Operator in Process Algebra , 1995 .

[4]  Jan J. M. M. Rutten,et al.  Automata and Coinduction (An Exercise in Coalgebra) , 1998, CONCUR.

[5]  G.D. Plotkin,et al.  LCF Considered as a Programming Language , 1977, Theor. Comput. Sci..

[6]  Martijn Hendriks,et al.  Model checking timed automata : techniques and applications , 2006 .

[7]  K. Larsen,et al.  Probabilistic Process Algebra , 2001 .

[8]  Maurice H. ter Beek,et al.  Team Automata: A Formal Approach to the Modeling of Collaboration Between System Components , 2003 .

[9]  Aa Twan Basten,et al.  In terms of nets : system design with Petri nets and process algebra , 1998 .

[10]  V. van Oostrom,et al.  Confluence for Abstract and Higher-Order Rewriting , 1994 .

[11]  Willem Otto David Griffioen,et al.  Studies in computer aided verification of protocols , 2000 .

[12]  Jan J. M. M. Rutten,et al.  Universal coalgebra: a theory of systems , 2000, Theor. Comput. Sci..

[13]  Theodorus Cornelis Ruys,et al.  Towards effective model checking , 2001 .

[14]  Andres Löh,et al.  Exploring generic Haskell , 2004 .

[15]  Daniele Turi,et al.  Abstract Syntax and Variable Binding (Extended Abstract) , 2003 .

[16]  Twan Laan.  The evolution of type theory in logic and mathematics , 1997 .

[17]  Brian A. Davey,et al.  Introduction to Lattices and Order: Preface to the second edition , 2002 .

[18]  Joost Visser,et al.  Generic traversal over typed source code representations , 2003 .

[19]  Jjd Joep Aerts.  Random redundant storage for video on demand , 2003 .

[20]  Mohammad Reza Mousavi,et al.  Structuring structural operational semantics , 2005 .

[21]  Sebastian Maneth,et al.  Models of tree translation , 2004 .

[22]  Cruz Filipe,et al.  Constructive real analysis : a type-theoretical formalization and applications , 2004 .

[23]  R. S. Venema,et al.  Aspects of an integrated neural prediction system , 1999 .

[24]  A. T. Hofkamp,et al.  Reactive machine control : a simulation approach using chi , 2001 .

[25]  Ivan Kurtev,et al.  Adaptability of model transformations , 2005 .

[26]  Daniel R. Tauritz,et al.  Adaptive Information Filtering: Concepts and Algorithms , 2002 .

[27]  Pedro R. D'Argenio,et al.  Algebras and Automata for Timed and Stochastic Systems , 1999 .

[28]  D. Turi,et al.  Functional Operational Semantics and its Denotational Dual , 1996 .

[29]  Gordon D. Plotkin,et al.  Concrete Domains , 1993, Theor. Comput. Sci..

[30]  Irene Bloemraad.  UNITY IN DIVERSITY? , 2007, Du Bois Review: Social Science Research on Race.

[31]  Atze Dijkstra.  Stepping through Haskell , 2000 .

[32]  Marco Kesseler,et al.  Implementation of Functional Languages , 2002, Lecture Notes in Computer Science.

[33]  Hartmut Peter Benz,et al.  Casual Multimedia Process Annotations -- CoMPAs , 2003 .

[34]  Olga Tveretina,et al.  A Decision Procedure for Equality Logic with Uninterpreted Functions , 2004, AISC.

[35]  Ricardo Corin,et al.  Analysis Models for Security Protocols , 2006 .

[36]  H.M.A. van Beek,et al.  Specification and analysis of Internet applications , 2005 .

[37]  Michael Barr,et al.  Additions and Corrections to "Terminal Coalgebras in Well-founded Set Theory" , 1994, Theor. Comput. Sci..

[38]  Bart Jacobs,et al.  Coalgebras and monads in the semantics of Java , 2003, Theor. Comput. Sci..

[39]  Yee Wei Law.  Key management and link-layer security of wireless sensor networks: Energy-efficient attack and defense , 2005 .

[40]  K. Leeuw.  Cryptology and statecraft in the Dutch Republic , 2000 .

[41]  Gabriele Lenzini,et al.  Integration of Analysis Techniques in Security and Fault-Tolerance , 2005 .

[42]  RJ Roy Willemen,et al.  School timetable construction : algorithms and complexity , 2002 .

[43]  Gao.  Design and verification of lock-free parallel algorithms , 2005 .

[44]  Ad M. G. Peeters,et al.  Single-rail handshake circuits , 1995, Proceedings Second Working Conference on Asynchronous Design Methodologies.

[45]  Joseph A. Goguen,et al.  Initial Algebra Semantics and Continuous Algebras , 1977, J. ACM.

[46]  ter Hugo Wilfried Laurenz Doest.  Towards Probabilistic Unification-Based Parsing , 1999 .

[47]  N.J.M. van den Nieuwelaar,et al.  Supervisory machine control by predictive-reactive scheduling , 2004 .

[48]  B. Courcelle.  Fundamental properties of infinite trees , 1983 .

[49]  Aart Middeldorp,et al.  Sequentiality in Orthogonal Term Rewriting Systems , 1991, J. Symb. Comput..

[50]  Peter Verbaan,et al.  The Computational Complexity of Evolving Systems , 2006 .

[51]  S. P. Luttik.  Choice quantification in process algebra , 2002 .

[52]  Ionel Bucur,et al.  Toposes, Algebraic Geometry and Logic , 1972 .

[53]  Aart Middeldorp,et al.  Decidable Call by Need Computations in term Rewriting (Extended Abstract) , 1997, CADE.

[54]  Florent Jacquemard,et al.  Decidable Approximations of Term Rewriting Systems , 1996, RTA.

[55]  Maria Eva Magdalena Lijding,et al.  Real-Time Scheduling of Tertiary Storage , 2003 .

[56]  Jurriaan Hage,et al.  Structural Aspects Of Switching Classes , 2001 .

[57]  Ad M. G. Peeters,et al.  An asynchronous low-power 80C51 microcontroller , 1998, Proceedings Fourth International Symposium on Advanced Research in Asynchronous Circuits and Systems.

[58]  den Jeremy Ian Hartog,et al.  Probabilistic Extensions of Semantical Models , 2002 .

[59]  D Dmitri Chkliaev,et al.  Mechanical verification of concurrency control and recovery protocols , 2001 .

[60]  Jozef Gruska.  Foundations of Computing , 1997 .

[61]  Jurgen Vinju,et al.  Analysis and transformation of source code by parsing and rewriting , 2005 .

[62]  Y Yuechen Qian,et al.  Data synchronization and browsing for home environments , 2004 .

[63]  Erika Ábrahám,et al.  An Assertional Proof System for Multithreaded Java - Theory and Tool Support , 2005 .

[64]  Jan Willem Klop,et al.  Combinatory reduction systems , 1980 .

[65]  V Victor Bos,et al.  Formal specification and analysis of industrial systems , 2002 .

[66]  Tac Tim Willemse.  Semantics and verification in process algebras with data and timing , 2003 .

[67]  D. Bosnacki.  Enhancing state space reduction techniques for model checking , 2001 .

[68]  Michel A. Reniers,et al.  Hybrid process algebra , 2005, J. Log. Algebraic Methods Program..

[69]  J. J. Vereijken,et al.  Discrete-time process algebra , 1997 .

[70]  Wpaj Wil Michiels.  Performance ratios for the differencing method , 2004 .

[71]  P. Zoeteweij,et al.  Composing constraint solvers , 2005 .

[72]  Ka Lok Man,et al.  Formal specification and analysis of hybrid systems , 2006 .

[73]  Martin Hyland.  A survey of some useful partial order relations on terms of the lambda calculus , 1975, Lambda-Calculus and Computer Science Theory.

[74]  Ts Ed Voermans.  Inductive datatypes with laws and subtyping : a relational model , 1999 .

[75]  Rmc Rene Ahn,et al.  Agents, objects and events : a computational approach to knowledge, observation and communication , 2001 .

[76]  Maurice Nivat,et al.  The metric space of infinite trees. Algebraic and topological properties , 1980, Fundam. Informaticae.

[77]  Cj Roel Bloo,et al.  Preservation of termination for explicit substitution , 1997 .

[78]  Tobias Nipkow,et al.  Term rewriting and all that , 1998 .

[79]  Christopher P. Wadsworth,et al.  The Relation Between Computational and Denotational Properties for Scott's Dinfty-Models of the Lambda-Calculus , 1976, SIAM J. Comput..

[80]  Tobias Nipkow,et al.  Higher-order critical pairs , 1991, [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science.

[81]  Sidney G. Winter,et al.  Naive Set Theory , 2021, Essential Mathematics for Undergraduates.

[82]  Paula Severi,et al.  Infinitary lambda calculus and discrimination of Berarducci trees , 2003, Theor. Comput. Sci..

[83]  R Rene Schiefer,et al.  Viper : a visualisation tool for parallel program construction , 1999 .

[84]  Salvador Lucas,et al.  Strongly Sequential and Inductively Sequential Term Rewriting Systems , 1998, Inf. Process. Lett..

[85]  Joseph R. Shoenfield,et al.  Mathematical logic , 1967 .

[86]  Stefan Blom,et al.  Skew confluence and the lambda calculus with letrec , 2002, Ann. Pure Appl. Log..

[87]  Dino Salvo Distefano,et al.  On model checking the dynamics of object-based software : a foundational approach , 2003 .

[88]  M. de Jonge,et al.  To reuse or to be reused. Techniques for component composition and construction , 2003 .

[89]  Martijn M. Schrage,et al.  Proxima: a presentation-oriented editor for structured documents , 2000 .

[90]  M. Kyas.  Verifying OCL Specifications of UML models , 2006 .

[91]  M. B. van der Zwaag,et al.  Models and logics for process algebra , 2002 .

[92]  Vincent van Oostrom,et al.  Meaningless Terms in Rewriting , 1996, J. Funct. Log. Program..

[93]  Jan Willem Klop,et al.  Transfinite Reductions in Orthogonal Term Rewriting Systems , 1995, Inf. Comput..

[94]  Emile H. L. Aarts,et al.  Parallel local search , 1995, J. Heuristics.

[95]  Jean-Jacques Lévy,et al.  Computations in Orthogonal Rewriting Systems, II , 1991, Computational Logic - Essays in Honor of Alan Robinson.

[96]  J.J.H. Fey,et al.  Design of a fruit juice blending and packaging plant , 2000 .

[97]  C.-H.L. Ong,et al.  Correspondence between operational and denotational semantics: the full abstraction problem for PCF , 1995, LICS 1995.

[98]  Lex Heerink,et al.  Ins and Outs in Refusal Testing , 1998 .

[99]  Dana S. Scott,et al.  Data Types as Lattices , 1976, SIAM J. Comput..

[100]  Nwa Norbert Arends,et al.  A systems engineering specification formalism , 1996 .

[101]  Ana Sokolova,et al.  Coalgebraic analysis of probabilistic systems , 2005 .

[102]  Jean-Jacques Lévy,et al.  Minimal and Optimal Computations of Recursive Programs , 1979, J. ACM.

[103]  G Boudol.  Computational semantics of term rewriting systems , 1986 .

[104]  Jpl John Segers.  Algorithms for the simulation of surface processes , 1999 .

[105]  A. G. Engels,et al.  Languages for analysis and testing of event sequences , 2001 .

[106]  M. Oostdijk.  Generation and presentation of formal mathematical documents , 2001 .

[107]  Nicholas Carriero,et al.  Linda and Friends , 1986, Computer.

[108]  M. Niqui,et al.  Formalising Exact Arithmetic. Representations, Algorithms and Proofs , 2004 .

[109]  R Ronald Ruimerman,et al.  Modeling and remodeling in bone tissue , 2005 .

[110]  J. Verriet.  Scheduling with communication for multiprocessor computation , 1998 .

[111]  Jeroen Eggermont,et al.  Data Mining using Genetic Programming : Classification and Symbolic Regression , 2005 .

[112]  Cheun Ngen Chong.  Experiments in rights control : expression and enforcement , 2005 .

[113]  Zena M. Ariola.  Relating graph and term rewriting via Böhm models , 2005, Applicable Algebra in Engineering, Communication and Computing.

[114]  Gérard Berry,et al.  Stable Models of Typed lambda-Calculi , 1978, ICALP.

[115]  Bruno Courcelle,et al.  The Algebraic Semantics of Recursive Program Schemes , 1978, MFCS.

[116]  M. Franssen.  Cocktail : a tool for deriving correct programs , 2000 .

[117]  Erik P. de Vink,et al.  Control flow semantics , 1996 .

[118]  T. Kuipers,et al.  Techniques for understanding legacy software systems , 2002 .

[119]  Jaap-Henk Hoepman,et al.  Communication, synchronization and fault tolerance , 1996 .

[120]  P. Severi.  Normalisation in lambda calculus and its relation to type inference , 1996 .

[121]  R. vanLiere.  Studies in Interactive Visualization , 2001 .

[122]  Leon Moonen,et al.  Exploring software systems , 2003, International Conference on Software Maintenance, 2003. ICSM 2003. Proceedings..

[123]  Jelasity Márk,et al.  The shape of evolutionary search: discovering and representingsearch space structure , 2001 .

[124]  Ivan Kurtev Ivanov,et al.  Adaptability of model transformations , 2005 .

[125]  Cees van Kemenade,et al.  Recombinative evolutionary search , 1999 .

[126]  A. M. Geerling,et al.  Transformational development of data-parallel algorithms , 1996 .

[127]  M. Bonsangue,et al.  Topological Dualities in Semantics , 1996 .

[128]  Hubert Comon.  Sequentiality, monadic second-order logic and tree automata , 2000 .

[129]  Ansgar Fehnker,et al.  Citius, Vilius, Melius : guiding and cost-optimality in model checking of timed and hybrid systems , 2002 .

[130]  Emilia I. Barakova,et al.  Learning reliability : a study on dindecisiveness in sample selection , 1999 .

[131]  Marieke Huisman,et al.  Reasoning about Java programs in higher order logic using PVS and Isabelle , 2001 .

[132]  Dennis Dams,et al.  Abstract interpretation and partition refinement for model checking , 1996 .

[133]  G Georgina Fabian,et al.  A language and simulator for hybrid systems , 1999 .

[134]  Giuseppe Longo,et al.  Set-theoretical models of λ-calculus: theories, expansions, isomorphisms , 1983, Ann. Pure Appl. Log..

[135]  Michael Barr,et al.  Terminal Coalgebras in Well-Founded Set Theory , 1993, Theor. Comput. Sci..

[136]  Peter H. Welch,et al.  Continuous semantics and inside-out reductions , 1975, Lambda-Calculus and Computer Science Theory.

[137]  J. P. Warners,et al.  Nonlinear approaches to satisfiability problems , 1999 .

[138]  Peter Achten,et al.  Interactive functional programs: models, methods, and implementation , 1996 .

[139]  Dick Alstein,et al.  Distributed algorithms for hard real-time systems , 1996 .

[140]  Christopher P. Wadsworth.  Approximate Reduction and Lambda Calculus Models , 1978, SIAM J. Comput..

[141]  Judi Maria Tirza Romijn,et al.  Analysing Industrial Protocols with Formal Methods , 1999 .

[142]  Bruno Courcelle,et al.  Infinite trees in normal form and recursive equations having a unique solution , 1979, Mathematical systems theory.

[143]  Stefan Blom,et al.  Term Graph Rewriting. Syntax and semantics , 2001 .

[144]  Daan Leijen,et al.  The λ Abroad - A Functional Approach to Software Components , 2003 .

[145]  Nachum Dershowitz,et al.  Rewrite, Rewrite, Rewrite, Rewrite, Rewrite, . . , 1991, Theor. Comput. Sci..

[146]  B. D. Fluiter.  Algorithms for graphs of small treewidth , 1997 .

[147]  M. Hyland.  A Syntactic Characterization of the Equality in Some Models for the Lambda Calculus , 1976 .

[148]  Goran Frehse,et al.  Compositional verification of hybrid systems using simulation relations , 2005 .

[149]  Simona Orzan,et al.  On Distributed Verification and Verified Distribution , 2004 .

[150]  Isabelle Reymen,et al.  Improving Design Processes through Structured Reflection: Feedback , 2001 .

[151]  de Ng Dick Bruijn,et al.  Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem , 1972 .

[152]  F. Bartels,et al.  On Generalised Coinduction and Probabilistic Specification Formats , 2004 .

[153]  Michel A. Reniers,et al.  Message sequence chart : syntax and semantics , 1999 .

[154]  Thomas Wolle,et al.  Computational aspects of treewidth : Lower bounds and network reliability , 2005 .

[155]  M. A. Valero Espada,et al.  Modal Abstraction and Replication of Processes with Data , 2005 .

[156]  Eelco Dolstra,et al.  The purely functional software deployment model , 2006 .

[157]  Michael Barr,et al.  Terminal coalgebras for endofunctors on sets , 2004 .

[158]  Alonzo Church,et al.  A formulation of the simple theory of types , 1940, Journal of Symbolic Logic.

[159]  G Goce Naumoski,et al.  A discrete-event simulator for systems engineering , 1998 .

[160]  Joao Paulo Saraiva,et al.  Purely Functional Implementation of Attribute Grammars , 1999 .

[161]  G. Rozenberg,et al.  Effective models for the structure of ð-calculus processes with replication , 2001 .

[162]  Edmund Robinson.  Variations on Algebra: Monadicity and Generalisations of Equational Therories , 2002, Formal Aspects of Computing.

[163]  F.A.M. van den Beuken,et al.  A functional approach to syntax and typing , 1997 .