Filters








3,735 Hits in 6.8 sec

Reasoning on an imperative object-based calculus in Higher Order Abstract Syntax

Alberto Ciaffaglione, Luigi Liquori, Marino Miculan
2003 Proceedings of the 2003 workshop on Mechanized reasoning about languages with variable binding - MERLIN '03  
We illustrate the benefits of using Natural Deduction in combination with weak Higher-Order Abstract Syntax for formalizing an object-based calculus with objects, cloning, method-update, types with subtyping  ...  This setting suggests a clean and compact formalization of the syntax and semantics of the calculus, with an efficient management of method closures.  ...  CONCLUSIONS AND FUTURE WORK In this paper, we have illustrated the benefits of using Natural Deduction in combination with Higher-Order Abstract Syntax and the Theory of Contexts for reasoning on object-calculi  ... 
doi:10.1145/976571.976574 dblp:conf/icfp/CiaffaglioneLM03 fatcat:j6f4gwlsvfdcpijst37bjannty

Higher-Order Abstract Syntax with Induction in Isabelle/HOL: Formalizing the π-Calculus and Mechanizing the Theory of Contexts [chapter]

Christine Röckl, Daniel Hirschkoff, Stefan Berghofer
2001 Lecture Notes in Computer Science  
This simplicity gives the π-calculus the power to encode the λ-calculus [16], as well as higher-order object-oriented and imperative languages [27, 26] .  ...  Higher-order abstract syntax builds upon a functional view, considering binders as abstractions with respect to an underlying λ-calculus to which the replacement of names and capture-avoidance are delegated  ...  This work has been supported by the PROCOPE project 9723064, "Verification Techniques for Higher Order Imperative Concurrent Languages".  ... 
doi:10.1007/3-540-45315-6_24 fatcat:q42oxe6uabd2deknr4oy3idkvy

Imperative Object-Based Calculi in Co-inductive Type Theories [chapter]

Alberto Ciaffaglione, Luigi Liquori, Marino Miculan
2003 Lecture Notes in Computer Science  
We give hence a new presentation of impς, exploiting natural deduction semantics, (weak) higher-order abstract syntax, and, for a significant fragment of the calculus, coinductive typing systems.  ...  We discuss the formalization of Abadi and Cardelli's impς, a paradigmatic object-based calculus with types and side effects, in Co-Inductive Type Theories, such as the Calculus of (Co)Inductive Constructions  ...  The authors are grateful to Yves Bertot, Joëlle Despeyroux, and Bernard Paul Serpette for fruitful discussions on earlier formalisations of impς.  ... 
doi:10.1007/978-3-540-39813-4_4 fatcat:vxmayi2q25a75l2r3veqhys2c4

A Higher-Order Specification of the π-Calculus [chapter]

Joëlle Despeyroux
2000 Lecture Notes in Computer Science  
The encoding of the π-calculus in Coq uses Coq functions to represent bindings of variables. This kind of encoding is called a higher-order specification.  ...  We present a formalization of a typed π-calculus in the Calculus of Inductive Constructions.  ...  Our description of the calculus comes out of many discussions we had, trying to understand and formalize the binding mechanism in the π-calculus.  ... 
doi:10.1007/3-540-44929-9_30 fatcat:t5oofqhkgjhzrbx5rkbbtt64cu

Plug and Play the Theory of Contexts in Higher-Order Abstract Syntax

Alberto Ciaffaglione, Ivan Scagnetto
2004 Electronical Notes in Theoretical Computer Science  
We illustrate the pragmatic aspects of the Theory of Contexts, recently proposed as a general approach for reasoning on languages with binders in Higher-Order Abstract Syntax, through two working examples  ...  Abstract Syntax, Theory of Contexts.  ...  The impς-calculus [1] is an imperative object-based calculus featuring objects, dynamic lookup, method update, cloning and local declarations: T erm : a, b ::= x variable [l i = ς(x i )b i ] i∈I object  ... 
doi:10.1016/j.entcs.2004.09.022 fatcat:zwqklz5mc5fhxc6qgd7kn2hbi4

Higher-order abstract syntax

F. Pfenning, C. Elliot
1988 Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation - PLDI '88  
We describe motivation, design, use, and implementation of higher-order abstract syntax as a central representation for programs, formulas, rules, and other syntactic objects in program manipulation and  ...  Higher-order abstract syntax incorporates name binding information in a uniform and language generic way. Thus it acts as a powerful link integrating diverse tools in such formal environments.  ...  Language Representation When one is faced with the task of implementing an object language using higher-order abstract syntax, one is faced with a variety of choices.  ... 
doi:10.1145/53990.54010 dblp:conf/pldi/PfenningE88 fatcat:hagwmtchqzf65mbemefw5kmvmq

Higher-order abstract syntax

F. Pfenning, C. Elliot
1988 SIGPLAN notices  
We describe motivation, design, use, and implementation of higher-order abstract syntax as a central representation for programs, formulas, rules, and other syntactic objects in program manipulation and  ...  Higher-order abstract syntax incorporates name binding information in a uniform and language generic way. Thus it acts as a powerful link integrating diverse tools in such formal environments.  ...  Language Representation When one is faced with the task of implementing an object language using higher-order abstract syntax, one is faced with a variety of choices.  ... 
doi:10.1145/960116.54010 fatcat:uo66hhnncjd7xmn46miblmv4su

Page 6545 of Mathematical Reviews Vol. , Issue 2000i [page]

2000 Mathematical Reviews  
6545 sound with respect to 42 (second order /-calculus). Next, we pro- vide an explicitly and an implicitly typed Damas-Milner system with y-operators.  ...  These characterizations naturally induce new forms of coin- duction principles for reasoning on program equivalences, which are not based on Abramsky’s applicative bisimulation.  ... 

A formalization of an Ordered Logical Framework in Hybrid with applications to continuation machines

Alberto Momigliano, Jeff Polakow
2003 Proceedings of the 2003 workshop on Mechanized reasoning about languages with variable binding - MERLIN '03  
We report on work in progress devoted to the formalization of an Ordered Logical Framework (OLF) [16] based on a twolevels architecture [10] in the Hybrid system [2] .  ...  OLF here is a second-order version of ordered linear logic to be used as a meta-language for the verification of the (meta)theory of deductive systems.  ...  Sometimes, however, the main issue is merely which kind of syntax best fits the bill, spanning from named syntax to De Bruijn indexes, to various forms of higher-order abstract syntax (HOAS).  ... 
doi:10.1145/976571.976581 dblp:conf/icfp/MomiglianoP03 fatcat:3pnqi7s43nh3roidcrkqugio3u

Reasoning about Computations Using Two-Levels of Logic [chapter]

Dale Miller
2010 Lecture Notes in Computer Science  
We describe an approach to using one logic to reason about specifications written in a second logic.  ...  One level of logic, called the "reasoning logic", is used to state theorems about computational specifications.  ...  I thank Andrew Gacek and Alwen Tiu for their comments on this paper.  ... 
doi:10.1007/978-3-642-17164-2_4 fatcat:rimxhzafvbhe3lfqqhq55kawlq

A Mechanized Model of the Theory of Objects [chapter]

Ludovic Henrio, Florian Kammüller
2007 Lecture Notes in Computer Science  
In particular, we present (a) a formal model of objects and its operational semantics based on de Bruijn indices (b) a parallel reduction relation for objects (c) the proof of confluence for the theory  ...  of objects reusing Nipkow's HOL-framework for the lambda calculus.  ...  We would like to thank Larry Paulson for providing us the formalization of the ς-calculus in Isabelle/ZF written by Ehmety.  ... 
doi:10.1007/978-3-540-72952-5_12 fatcat:zhdvufkxv5hrjnf4yfmv6btlnu

Mechanized Metatheory Revisited: An Extended Abstract (Invited Paper)

Dale Miller, Michael Wagner
2018 Types for Proofs and Programs  
One possible approach to designing programming languages and proof assistants that directly supports such an approach to bindings in syntax is presented.  ...  I will also illustrate how that framework provides an intimate and semantically clean treatment of computation and reasoning with syntax containing bindings.  ...  λ-tree syntax The term higher-order abstract syntax (HOAS) was originally defined as an approach to syntax that used "a simply typed λ-calculus enriched with products and polymorphism" [65] .  ... 
doi:10.4230/lipics.types.2016.1 dblp:conf/types/Miller16 fatcat:ryflgp5aqvh4pjd7x6jff3keky

iRho: an imperative rewriting calculus

LUIGI LIQUORI, BERNARD PAUL SERPETTE
2008 Mathematical Structures in Computer Science  
We propose an imperative version of the Rewriting Calculus, a calculus based on pattern matching, pattern abstraction and side effects, which we call iRho.  ...  The static semantics is given using a first-order type system based on a form of product types, which can be assigned to term-like structures (that is, records).  ...  Acknowledgments The authors would like to thank all the members of the Protheo Team in Nancy for their invaluable comments and interactions on the subject of the Rewriting Calculus.  ... 
doi:10.1017/s0960129508006750 fatcat:xqxtkv75kzcxvgx2cabyh7zeea

Call by name, assignment, and the lambda calculus

Martin Odersky, Dan Rabin, Paul Hudak
1993 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '93  
The extended calculus has neither a concept of an explicit store nor a concept of evaluation order nevertheless, we show that programs in the calculus can be implemented using a single-threaded store.  ...  We de ne an extension of the call-by-name lambda calculus with additional constructs and reduction rules that represent m utable variables and assignments.  ...  Acknowledgements This work was supported in part by D ARPA grant n umber N00014-91-J-4043. The second author was supported by an IBM Graduate Fellowship during the nal preparation of this paper.  ... 
doi:10.1145/158511.158521 dblp:conf/popl/OderskyRH93 fatcat:gr5todqrznazppb3eneudz4d7i

iRho

Luigi Liquori, Bernard Paul Serpette
2004 Proceedings of the 6th ACM SIGPLAN international conference on Principles and practice of declarative programming - PPDP '04  
We propose an imperative version of the Rewriting-calculus, a calculus based on pattern-matching, pattern-abstraction, and side-effects, which we call iRho.  ...  The static semantics is given via a first-order type system based on a form of product-type, which can be assigned to iRho-terms like structures (i.e. pairs).  ...  The authors would like to thank all the members of the Protheo Team in Nancy for their comments and interactions on Rewriting Calculus.  ... 
doi:10.1145/1013963.1013983 dblp:conf/ppdp/LiquoriS04 fatcat:ahntsla4fnd3thabdyztfn2c6m
« Previous Showing results 1 — 15 out of 3,735 results