Results 1  10
of
1,644,785
Parametric Polymorphism and Operational Equivalence
 MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE
, 2000
"... Studies of the mathematical properties of impredicative polymorphic types have for the most part focused on the polymorphic lambda calculus of Girard–Reynolds, which is a calculus of total polymorphic functions. This paper considers polymorphic types from a functional programming perspective, where ..."
Abstract

Cited by 84 (2 self)
 Add to MetaCart
operational behaviour to parametricity properties of types. Working with an extension of Plotkin's PCF with ∀types, lazy lists and existential types, we show by example how the resulting logical relation can be used to prove properties of polymorphic types up to operational equivalence.
Operational Equivalence for Interaction Nets
"... The notion of contextual (or operational) equivalence is fundamental in the theory of programming languages. By setting up a notion of bisimilarity, and showing that it coincides with contextual equivalence, one obtains a simple coinductive proof technique for showing that two programs are equivalen ..."
Abstract

Cited by 13 (5 self)
 Add to MetaCart
The notion of contextual (or operational) equivalence is fundamental in the theory of programming languages. By setting up a notion of bisimilarity, and showing that it coincides with contextual equivalence, one obtains a simple coinductive proof technique for showing that two programs
Parametric Polymorphism and Operational Equivalence
, 1998
"... Studies of the mathematical properties of impredicative polymorphic types have for the most part focused on the polymorphic lambda calculus of GirardReynolds, which is a calculus of total polymorphic functions. This paper considers polymorphic types from a functional programming perspective, where ..."
Abstract
 Add to MetaCart
operational behaviour to parametricity properties of types. Working with an extension of Plotkin’s PCF with ∀types, lazy lists and existential types, we show by example how the resulting logical relation can be used to prove properties of polymorphic types up to operational equivalence. 1.
Operational Equivalence of Graph Transformation Systems
"... Abstract. Graph transformation systems (GTS) provide an important theory for numerous applications. With the growing number of GTSbased applications the comparison of operational equivalence of two GTS becomes an important area of research. This work introduces a notion of operational equivalence fo ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Abstract. Graph transformation systems (GTS) provide an important theory for numerous applications. With the growing number of GTSbased applications the comparison of operational equivalence of two GTS becomes an important area of research. This work introduces a notion of operational equivalence
Operational Equivalence of CHR Programs And Constraints
 In 5th International Conference on Principles and Practice of Constraint Programming, CP'99, LNCS 1713
, 1999
"... . A fundamental question in programming language semantics is when two programs should be considered equivalent. In this paper we introduce a notion of operational equivalence for CHR programs and userdefined constraints. Constraint Handling Rules (CHR) is a highlevel language for writing constrain ..."
Abstract

Cited by 21 (6 self)
 Add to MetaCart
. A fundamental question in programming language semantics is when two programs should be considered equivalent. In this paper we introduce a notion of operational equivalence for CHR programs and userdefined constraints. Constraint Handling Rules (CHR) is a highlevel language for writing
An Operational Equivalence Checker for CHR
, 2014
"... This work is licensed under the Creative Commons AttributionNonCommercialShareAlike 3.0 License. To view a copy of this license, visit ..."
Abstract
 Add to MetaCart
This work is licensed under the Creative Commons AttributionNonCommercialShareAlike 3.0 License. To view a copy of this license, visit
The Skyline Operator
 IN ICDE
, 2001
"... We propose to extend database systems by a Skyline operation. This operation filters out a set of interesting points from a potentially large set of data points. A point is interesting if it is not dominated by any other point. For example, a hotel might be interesting for somebody traveling to Nass ..."
Abstract

Cited by 558 (3 self)
 Add to MetaCart
We propose to extend database systems by a Skyline operation. This operation filters out a set of interesting points from a potentially large set of data points. A point is interesting if it is not dominated by any other point. For example, a hotel might be interesting for somebody traveling
Monitors: An Operating System Structuring Concept
 Communications of the ACM
, 1974
"... This is a digitized copy derived from an ACM copyrighted work. It is not guaranteed to be an accurate copy of the author's original work. This paper develops BrinchHansen's concept of a monitor as a method of structuring an operating system. It introduces a form of synchronization, descri ..."
Abstract

Cited by 561 (0 self)
 Add to MetaCart
This is a digitized copy derived from an ACM copyrighted work. It is not guaranteed to be an accurate copy of the author's original work. This paper develops BrinchHansen's concept of a monitor as a method of structuring an operating system. It introduces a form of synchronization
A Structural Approach to Operational Semantics
, 1981
"... Syntax of a very simple programming language called L. What is abstract about it will be discussed a little here and later at greater length. For us syntax is a collection of syntactic sets of phrases; each set corresponds to a different type of phrase. Some of these sets are very simple and can be ..."
Abstract

Cited by 1541 (3 self)
 Add to MetaCart
Syntax of a very simple programming language called L. What is abstract about it will be discussed a little here and later at greater length. For us syntax is a collection of syntactic sets of phrases; each set corresponds to a different type of phrase. Some of these sets are very simple and can be taken as given: Truthvalues This is the set T = ftt; ffg and is ranged over by (the metavariable) t (and we also happily employ for this (and any other) metavariable sub and superscripts to generate other metavariables: t ; t 0 ; t 1k ).
Existential Types: Logical Relations and Operational Equivalence
 In Proceedings of the 25th International Colloquium on Automata, Languages and Programming
, 1998
"... . Existential types have proved useful for classifying various kinds of information hiding in programming languages, such as occurs in abstract datatypes and objects. In this paper we address the question of when two elements of an existential type are semantically equivalent. Of course, it depends ..."
Abstract

Cited by 34 (2 self)
 Add to MetaCart
what one means by `semantic equivalence'. Here we take a syntactic approachso semantic equivalence will mean some kind of operational equivalence. The paper begins by surveying some of the literature on this topic involving `logical relations'. Matters become quite complicated
Results 1  10
of
1,644,785