Filters








57,956 Hits in 8.0 sec

Page 6651 of Mathematical Reviews Vol. , Issue 90K [page]

1990 Mathematical Reviews  
We might call it a ‘polymorphic set theory’. Our theory combines the A-caiculus with traditional set theories.  ...  system based on set theory.  ... 

Polymorphisms, Markov processes, quasi-similarity

A. Vershik
2005 Discrete and Continuous Dynamical Systems. Series A  
We describe the main notions and discuss relations to the theory of Markov processes, operator theory, ergodic theory, etc.  ...  In this paper we develop the theory of polymorphisms of measure spaces, which is a generalization of the theory of measure-preserving transformations.  ...  Denote by A n the σ-subfield in Y generated by the set of one-dimensional cylindric sets at time n, and by A − (respectively, A + ) the tail σ-field of the past (respectively, future) of the process.  ... 
doi:10.3934/dcds.2005.13.1305 fatcat:fsiwpr3iebeznmgfuuy26ad5wm

Polymorphisms, Markov processes, random perturbations of K-automorphisms [article]

A.Vershik
2004 arXiv   pre-print
In this paper we develop the theory of polymorphisms of measure spaces, which is a generalization of the theory of measure-preserving transformations; we describe the main notions and discuss relations  ...  We prove that it is possible and the automorphism must be a K-automorphism and the polymorphism must be a special random perturbation of the automorphism; more exactly, the polymorphism is a random walk  ...  Denote by A n the σ-subfield in Y generated by the set of one-dimensional cylindric sets at time n, and by A − (respectively, A + ) the tail σ-field of the past (respectively, future) of the process.  ... 
arXiv:math/0409492v2 fatcat:2f2ecehmrrgq3ju3gapqvvnvbm

The Complexity of Valued Constraint Satisfaction

Peter Jeavons, Andrei A. Krokhin, Stanislav Zivný
2014 Bulletin of the European Association for Theoretical Computer Science  
We survey recent results on the broad family of problems that can be cast as valued constraint satisfaction problems.  ...  We discuss general methods for analysing the complexity of such problems, give examples of tractable cases, and identify general features of the complexity landscape.  ...  For any finite set V, a rational-valued function h defined on subsets of V is called a set function.  ... 
dblp:journals/eatcs/JeavonsKZ14 fatcat:3m6natv2pnbdrhawutfcka4xbe

An Algebraic Theory of Complexity for Valued Constraints: Establishing a Galois Connection [chapter]

David A. Cohen, Páidí Creed, Peter G. Jeavons, Stanislav Živný
2011 Lecture Notes in Computer Science  
We define a Galois connection between valued constraint languages and sets of weighted polymorphisms and show how the closed sets of this Galois connection can be characterised.  ...  constraint language, which we call weighted polymorphisms.  ...  Here, we prove the same for weighted polymorphisms, but also establish a 1-to-1 correspondence between valued constraint languages and particular sets of weighted polymorphisms, which we call weighted  ... 
doi:10.1007/978-3-642-22993-0_23 fatcat:n2lvea2ckfbypiho2kckod3xkq

A Syntactic View of Computational Adequacy [chapter]

Marco Devesas Campos, Paul Blain Levy
2018 Lecture Notes in Computer Science  
Our account begins with PCF, then includes sum types, then moves to call-by-push-value, and finally includes polymorphic types. P. B. Levy-Research Supported by UK EPSRC Grant EP/N023757/1.  ...  The purpose of the paper is to present this syntactic result for call-bypush-value extended with term-level recursion and polymorphic types.  ...  Call-by-push with recursion-value-syntax Table 6 . Call-by-push-value with recursion-reduction Theory Theory.  ... 
doi:10.1007/978-3-319-89366-2_4 fatcat:liwevar3kveh5csnwbrs65gtkm

Relational Parametricity for Control Considered as a Computational Effect

Rasmus Ejlers Møgelberg, Alex Simpson
2007 Electronical Notes in Theoretical Computer Science  
Our approach is to specialise a general type theory combining polymorphism and computational effects, by extending it with additional constants expressing control.  ...  Hasegawa on type definability in the second-order (call-by-name) λμ-calculus arise as special cases of general results valid for arbitrary computational effects.  ...  Acknowledgement We thank Masahito Hasegawa and Paul Levy for helpful discussions.  ... 
doi:10.1016/j.entcs.2007.02.040 fatcat:im3phc3ewba73j5jodsz7snqg4

Towards the Definition of Metric Hyperbolicity

A. Vershik
2005 Moscow Mathematical Journal  
Instead of the notions of stable and unstable foliations and other notions from smooth theory, we use the tools of the theory of polymorphisms.  ...  We call an automorphism with given hyperbolic structure a hyperbolic automorphism and prove that it is canonically quasi-similar to a so-called prime nonmixing polymorphism.  ...  The measure ν is called the bistochastic measure of the polymorphism Π. Let us define the main structures on the set of the polymorphisms and the notions of the theory of the polymorphisms. 1.  ... 
doi:10.17323/1609-4514-2005-5-3-721-737 fatcat:ayn2qp2btvd6zeiphtepvrcgte

Selected Extended Papers of ITP 2017

Mauricio Ayala-Rincón, César Muñoz
2018 Journal of automated reasoning  
by Springer Nature.  ...  The papers were carefully reviewed by specialists, including members of the ITP 2017 PCs and additional experts.  ...  Yannick Forster and Gert Smolka, in Call-by-Value Lambda Calculus as a Model of Computation in Coq, present the programming language L, a subsystem of the λ-calculus with a weak head and call-by-value  ... 
doi:10.1007/s10817-018-09500-0 fatcat:no6wykx3jrdphd2kalkgqnocqi

Towards the definition of metric hyperbolicity [article]

A.Vershik
2005 arXiv   pre-print
Instead of the notions of stable and unstable foliations and other notions from smooth theory, we use the tools of the theory of polymorphisms.  ...  We call an automorphism with given hyperbolic structure a hyperbolic automorphism and prove that it is canonically quasi-similar to a so-called prime nonmixing polymorphism.  ...  Let us define the main structures on the set of the polymorphisms and the notions of the theory of the polymorphisms. 1.A polymorphism Π * is called conjugate to the polymorphism Π if its diagram is obtained  ... 
arXiv:math/0508514v1 fatcat:6fqv772p3zddnh4ubdekseyk4a

From Theory to Practice of Algebraic Effects and Handlers (Dagstuhl Seminar 16112)

Andrej Bauer, Martin Hofmann, Matija Pretnar, Jeremy Yallop, Marc Herbstritt
2016 Dagstuhl Reports  
techniques for algebraic effects and handlers, and implementations of effects in Haskell.  ...  , nondeterminism, and many others).  ...  Finally, we sketched how one may adapt a standard type system for a call-by-value language into a type & effect system, which captures the set of potentially called operations in addition to the type of  ... 
doi:10.4230/dagrep.6.3.44 dblp:journals/dagstuhl-reports/Bauer0PY16 fatcat:5whd2flnxbg6lck2kx3qlkekaq

Relational Parametricity for Computational Effects

Rasmus Møgelberg, Alex Simpson, Robert Tennent
2009 Logical Methods in Computer Science  
Many programs, however, exhibit computational effects, and are not accounted for by the standard theory of relational parametricity.  ...  Such properties have been well studied in a pure functional setting.  ...  Acknowledgements We are indebted to Masahito Hasegawa for first suggesting that (1) should be a general phenomenon within a monadic framework incorporating both linear and continuation-passing settings  ... 
doi:10.2168/lmcs-5(3:7)2009 fatcat:ir3z66ushjez3dh2jrj3yakiqe

Customizable gradual polymorphic effects for Scala

Matías Toro, Éric Tanter
2015 Proceedings of the 2015 ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages, and Applications - OOPSLA 2015  
This paper addresses these issues by presenting the first implementation of gradual effect checking, for Scala, which supports both effect polymorphism and a domain-specific language called Effscript to  ...  However, no existing system combines these approaches: the theory of gradual polymorphic effects has not been developed, and there are no implementations of gradual effect checking.  ...  We thank Jonathan Aldrich, Felipe Bañados, Jose Daniel Carrasco, Ricardo Jacas, and Gustavo Soto-Ridd for discussions and feedback on either the paper, the artifact, or both.  ... 
doi:10.1145/2814270.2814315 dblp:conf/oopsla/ToroT15 fatcat:djd5f2ffsve6lnlm37v2pfsl4e

Relational Parametricity for Computational Effects

Rasmus Ejlers Mogelberg, Alex Simpson
2007 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007)  
The notion of relational parametricity, introduced by Reynolds, is one possible mathematical formulation of this idea.  ...  Such properties have been well studied in a pure functional setting. Real programs, however, exhibit computational effects.  ...  Acknowledgements We are indebted to Masahito Hasegawa for first suggesting that (1) should be a general phenomenon within a monadic framework incorporating both linear and continuation-passing settings  ... 
doi:10.1109/lics.2007.40 dblp:conf/lics/MogelbergS07 fatcat:knyapdfuarbhddxx73wxbdljky

Customizable gradual polymorphic effects for Scala

Matías Toro, Éric Tanter
2015 SIGPLAN notices  
This paper addresses these issues by presenting the first implementation of gradual effect checking, for Scala, which supports both effect polymorphism and a domain-specific language called Effscript to  ...  However, no existing system combines these approaches: the theory of gradual polymorphic effects has not been developed, and there are no implementations of gradual effect checking.  ...  We thank Jonathan Aldrich, Felipe Bañados, Jose Daniel Carrasco, Ricardo Jacas, and Gustavo Soto-Ridd for discussions and feedback on either the paper, the artifact, or both.  ... 
doi:10.1145/2858965.2814315 fatcat:dvhre2iv6ze2tpoaozekhg5hmm
« Previous Showing results 1 — 15 out of 57,956 results