A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
RGM study of the NN interaction in an extended quark model
1987
Nuclear Physics A
Preserved Fulltext
The extended quark model study of the NN interaction, in which the (q~) excitations inherent in the quark-gluon interaction are explicitly incorporated into the model space, is completed with the inclusion ...
With one improvement of the model, to yield an N~ tensor force with OPEP strength and long-range characteristics, this model leads to a prediction of the low-energy NN scattering data and deuteron bound ...
The numerical values of Iq (a) are most easily obtained through a recursion relation ...
doi:10.1016/0375-9474(87)90569-0
fatcat:5f6nqfxhazbejcdesyl5c37gwu
Page 6642 of Mathematical Reviews Vol. , Issue 90K
[page]
1990
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
This paper studies when programs have nonessential recursion. The results are thus useful for efficiency purposes. ...
In this paper, we discuss the concepts of extended data dependencies for the extended relational model and the conditions under which an extended relation can be decom- posed further into its projections ...
Page 435 of Mathematical Reviews Vol. , Issue 92a
[page]
1992
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
We use the notion of membership in C to unify and extend previous work on determining decidable classes of bounded recursions.”
92a:68041 68P15 68U10
Pomykata, Janusz A. ...
The scheme of such an object-history consists of input attributes and evaluation attributes. ...
Page 3232 of Mathematical Reviews Vol. , Issue 97E
[page]
1997
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Hagino unifies the notions of an algebra and that of a co-algebra. If F:A— B and G:A — B are given functors, an F, G-dialgebra (a,y) is given by an object a in A and a morphism y: Fa — Ga in B. ...
Recursive data structures are expressed by applying the Knaster-Tarski theorem to a set, such as V,,, that is closed under Cartesian product and disjoint sum. ...
Page 4553 of Mathematical Reviews Vol. , Issue 92h
[page]
1992
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
We study the properties of representability and recursiveness of these models. ...
4553
complexly structured object domains. ...
Histo- and dynamorphisms revisited
2013
Proceedings of the 9th ACM SIGPLAN workshop on Generic programming - WGP '13
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
Histomorphisms and dynamorphisms have been introduced to expresses such algorithms in terms of structured recursion schemes that leverage this structure. ...
as well as one that uses recursion schemes. ...
Acknowledgments This work has been funded by EPSRC grant number EP/J010995/1, on Unifying Theories of Generic Programming. ...
doi:10.1145/2502488.2502496
dblp:conf/icfp/HinzeW13
fatcat:o7vaczc4mve4lczjl5ap4iewde
Polymorphic Intersection Type Assignment for Rewrite Systems with Abstraction and β-Rule
[chapter]
2000
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
For this system we define, using an extended notion of unification, a notion of principal type, and show that type assignment is decidable. ...
We define two type assignment systems for first-order rewriting extended with application, -abstraction, and -reduction (TRS ). ...
. , are defined incrementally (i.e. there is no mutual recursion), by typeable rules that satisfy the general scheme: This general scheme is a generalization of primitive recursion. ...
doi:10.1007/3-540-44557-9_3
fatcat:fweecy2czbbkzgk4b7r4vdpcey
Type checking records and variants in a natural extension of ML
1989
Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '89
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
With this encoding ML naturally extends its polymorphism to records but any other host language will also transmit its power. ...
We solve this problem by giving an ordinary status to records without any ad hoc assertions, replacing inclusion rules by extra information in record types. ...
Concrete data types can be defined recursively, and variants encoding them will be recursive. So we extend ordinary types to recursive types. ...
doi:10.1145/75277.75284
dblp:conf/popl/Remy89
fatcat:2csf6zynobbefnm57jurs6xmdy
Learning Recursive Automata from Positive Examples
2006
Revue d'intelligence artificielle : Revue des Sciences et Technologies de l'Information
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
The relation between these generalized automata and categorial grammars is studied in detail. ...
To this aim, we first study how to translate finite state automata into categorial grammars and back. ...
not unifying substitutions) you do not extend the class of accessible structured languages, so you can afford to avoid them. ...
doi:10.3166/ria.20.775-804
fatcat:s4kxnkdtefb7daokgwnihiaq5i
Page 287 of Mathematical Reviews Vol. , Issue 2002A
[page]
2002
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
The somewhat unusual starting point and unifying tool is the FM recursion scheme T x X, = OX,—; (T a unit tangent vector), Yo = —T7,, together with the requirement of arclength preserving evolution
The ...
The paper also treats various other aspects of bi-Hamiltonian structures including webs, Lenard schemes and Lax structures. ...
Conjugate Hylomorphisms -- Or
2015
Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages - POPL '15
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The past decades have witnessed an extensive study of structured recursion schemes. ...
In fact, almost every structured recursion scheme seems to arise as an instance of the conjugate rule. ...
Indeed, in many ways the present work extends the unification of structured recursion schemes presented in [13] , which showed that recursion schemes from comonads [31] are subsumed by adjoint folds ...
doi:10.1145/2676726.2676989
dblp:conf/popl/HinzeWG15
fatcat:zo2sbmkynra5pexg62yur2dhzu
Conjugate Hylomorphisms -- Or
2015
SIGPLAN notices
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The past decades have witnessed an extensive study of structured recursion schemes. ...
In fact, almost every structured recursion scheme seems to arise as an instance of the conjugate rule. ...
Indeed, in many ways the present work extends the unification of structured recursion schemes presented in [13] , which showed that recursion schemes from comonads [31] are subsumed by adjoint folds ...
doi:10.1145/2775051.2676989
fatcat:ilkugd6olvenpebplq3yymkvj4
Recursion-closed algebraic theories
1981
Journal of computer and system sciences (Print)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
A class of algebraic theories called "recursion-closed," which generalize the rational theories studied by J. investigated. ...
This new class of algebraic theories, is defined and studied, and "free recursion-closed algebraic theories" are proved to exist. ...
confers an interesting structure on the class of schemes. ...
doi:10.1016/0022-0000(81)90006-4
fatcat:kinwn45jnvhpbeebmwawmmckq4
Unified Analysis of Collapsible and Ordered Pushdown Automata via Term Rewriting
[article]
2014
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
This result subsumes and unifies similar analyses on collapsible and ordered pushdown systems. ...
Despite the rich literature on inverse preservation of recognizability for term rewrite systems, our result does not seem to follow from any previous study. ...
There has recently been an effort to model more complex features of recursive programs. ...
arXiv:1410.4065v1
fatcat:ch6ld55th5fpxhixr54s776dta
Page 755 of Mathematical Reviews Vol. , Issue 80B
[page]
1980
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Nivat, The alge- braic semantics of recursive program schemes (pp. 16-30); Edsger W. Dijkstra, Finding the correctness proof of a concurrent pro- gram (pp. 31-38); V. E. ...
An algebraic approach. I (pp. 436-441); N. ...
« Previous
Showing results 1 — 15 out of 25,832 results