Filters








46,434 Hits in 4.5 sec

A Domain Semantics for Higher-Order Recursive Processes [article]

Ryan Kavanagh
<span title="2020-05-10">2020</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
It supports general recursion, asynchronous and synchronous communication, and higher-order programs that communicate channels and processes.  ...  We give polarized SILL a domain-theoretic semantics---the first denotational semantics for a language with this combination of features.  ...  The author thanks anonymous referees, Robert Atkey, Stephen Brookes, and Frank Pfenning for their comments.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2002.01960v3">arXiv:2002.01960v3</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/vwtykhdghvfxzbiukmo2gq2vhi">fatcat:vwtykhdghvfxzbiukmo2gq2vhi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200527201437/https://arxiv.org/pdf/2002.01960v3.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2002.01960v3" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Page 6674 of Mathematical Reviews Vol. , Issue 94k [page]

<span title="">1994</span> <i title="American Mathematical Society"> <a target="_blank" rel="noopener" href="https://archive.org/details/pub_mathematical-reviews" style="color: black;">Mathematical Reviews </a> </i> &nbsp;
In this paper, we develop a 68 COMPUTER SCIENCE 6674 theory of higher-order computability suitable for comparing the expressiveness of sequential deterministic programming languages.  ...  Finally, we give a polynomial time algorithm for a set of tasks with oppositely ordered ready times and deadlines, and similarly ordered mandatory execution times and total execution times.” 94k:68017  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_1994-11_94k/page/6674" title="read fulltext microfilm" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Archive [Microfilm] <div class="menu fulltext-thumbnail"> <img src="https://archive.org/serve/sim_mathematical-reviews_1994-11_94k/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

Historical introduction to "concrete domains" by G. Kahn and G.D. Plotkin

Stephen Brookes
<span title="">1993</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/elaf5sq7lfdxfdejhkqbtz6qoq" style="color: black;">Theoretical Computer Science</a> </i> &nbsp;
Dana Scott developed a theory of domains and continuous functions that established adequate mathematical foundations for Strachey's semantic descriptions and formed the basis for the denotational approach  ...  Semantic domains were typically taken to be complete lattices [38] or more general kinds of complete partial order [38, 251, the precise combination of order-theoretic assumptions being chosen to suit  ...  Acknowledgment I would like to thank Samson Abramsky, GCrard Berry, Pierre-Louis Curien, Gilles Kahn, Gordon Plotkin and Glynn Winskel for helping to clarify the history behind this work and for suggesting  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0304-3975(93)90089-c">doi:10.1016/0304-3975(93)90089-c</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/mmkq4foztvfqnan3uydh5ekzpe">fatcat:mmkq4foztvfqnan3uydh5ekzpe</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170925065650/http://publisher-connector.core.ac.uk/resourcesync/data/elsevier/pdf/240/aHR0cDovL2FwaS5lbHNldmllci5jb20vY29udGVudC9hcnRpY2xlL3BpaS8wMzA0Mzk3NTkzOTAwODlj.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/a4/38/a438a0c17728de2289b45dbb2e35bbee7d9bf2fa.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0304-3975(93)90089-c"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Specifying and verifying parametric processes [chapter]

Wiesław Pawłowski, Paweł Paczkowski, Stefan Sokołowski
<span title="">1996</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
Higher order process-parameters are allowed. The formalism resembles typed lambda calculus built on top of a process algebra, where speci cations play the role of types.  ...  A proof system for deriving judgements \parametric process meets a speci cation" is given.  ...  We would like to thank Thorsten Altenkirch, K arlis Cern as and Uno Holmer for helpful comments on this work.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-61550-4_171">doi:10.1007/3-540-61550-4_171</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/b2opvzznebfrvb34acc3ehz4au">fatcat:b2opvzznebfrvb34acc3ehz4au</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190225135653/http://pdfs.semanticscholar.org/605c/c68f51eb931e581752ea19954618b08ce81a.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/60/5c/605cc68f51eb931e581752ea19954618b08ce81a.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-61550-4_171"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Higher Order Demand Propagation [chapter]

Dirk Pape
<span title="">1999</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
The richness of the semantic domains of higher order demand propagation makes it possible to express generalised strictness information for higher order functions even across module boundaries.  ...  This report defines a semantics for higher order demand propagation and relates it to the standard semantics of the functional language.  ...  a higher order and polymorphic language and works with infinite domains in the non-standard semantics.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-48515-5_10">doi:10.1007/3-540-48515-5_10</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/64sxz5jgordzhbc5nlinkvns6u">fatcat:64sxz5jgordzhbc5nlinkvns6u</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20060517004624/http://www.inf.fu-berlin.de:80/inst/pubs/tr-b-98-15.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/86/da/86da0496d756a016a900e81307c98df3e2c9c7bf.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-48515-5_10"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

A calculus of higher order communicating systems

B. Thomsen
<span title="">1989</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2qaxtqe2rfgjnfefqcokcnzelq" style="color: black;">Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL &#39;89</a> </i> &nbsp;
In this paper we present A Calculus of Higher Order Communicating Systems. This calculus considers sending and receiving processes to be as fundamental as nondeterminism and parallel composition.  ...  The relationship between CHOCS and the untyped X-calculus is further strengthened by a result showing that the recursion operator is unnecessary in the sense that recursion can be simulated by means of  ...  Boudol and for making me aware of the fact that my first definition of procedures in the semantics of P described dynamic binding.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/75277.75290">doi:10.1145/75277.75290</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/popl/Thomsen89.html">dblp:conf/popl/Thomsen89</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/dg7zmllo5ffvzhlar3hl2cosiu">fatcat:dg7zmllo5ffvzhlar3hl2cosiu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190217042708/https://static.aminer.org/pdf/20170130/pdfs/popl/q8d6l4ywkky9jaixbr51vhgqu3gepmht.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/e4/19/e41962a2619e1b8be70cc059c9fd0728c2a709d0.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/75277.75290"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Page 5546 of Mathematical Reviews Vol. , Issue 95i [page]

<span title="">1995</span> <i title="American Mathematical Society"> <a target="_blank" rel="noopener" href="https://archive.org/details/pub_mathematical-reviews" style="color: black;">Mathematical Reviews </a> </i> &nbsp;
process semantics.  ...  Process. Lett. 53 (1995), no. 1, 5—9. Summary: “For programs represented semantically as relations, a concept of semantic independence is defined that is more general than previously stated notions.  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_1995-09_95i/page/5546" title="read fulltext microfilm" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Archive [Microfilm] <div class="menu fulltext-thumbnail"> <img src="https://archive.org/serve/sim_mathematical-reviews_1995-09_95i/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

Page 6955 of Mathematical Reviews Vol. , Issue 95k [page]

<span title="">1995</span> <i title="American Mathematical Society"> <a target="_blank" rel="noopener" href="https://archive.org/details/pub_mathematical-reviews" style="color: black;">Mathematical Reviews </a> </i> &nbsp;
Summary: “Semantic models are presented for two simple imper- ative languages with higher order constructs.  ...  In addition to higher order pro- gramming notions, we use higher order definitional techniques, e.g., in defining the semantic mappings as fixed points of (con- tractive) higher order operators.  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_1995-11_95k/page/6955" title="read fulltext microfilm" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Archive [Microfilm] <div class="menu fulltext-thumbnail"> <img src="https://archive.org/serve/sim_mathematical-reviews_1995-11_95k/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

On the Syntax-Semantics Interface of Argument Marking Prepositional Phrases [chapter]

Roussanka Loukanova, M. Dolores Jiménez-López
<span title="">2012</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/rosvk2drxjeehey7njq6wkgv6e" style="color: black;">Advances in Intelligent and Soft Computing</a> </i> &nbsp;
Additionally, they can carry substantial semantic information. The paper contributes to methods of language processing by integrated algorithmic syntaxsemantics interface.  ...  The work is part of development of a new type-theoretic approach to the concepts of algorithm and algorithmic syntax-semantics interfaces.  ...  For initial applications of L λ ar to computational syntaxsemantics interface in CBLG of human language, see [3]. The formal system L λ ar is a higher-order type theory.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-28762-6_7">doi:10.1007/978-3-642-28762-6_7</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/paams/LoukanovaJ12.html">dblp:conf/paams/LoukanovaJ12</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/towgkmk3xng4dbtcjyrejai7m4">fatcat:towgkmk3xng4dbtcjyrejai7m4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190223134326/http://pdfs.semanticscholar.org/45f8/74ff898dcef5c9b5e1559db3c2e636a18053.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/45/f8/45f874ff898dcef5c9b5e1559db3c2e636a18053.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-28762-6_7"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Geometric semantic genetic programming for recursive boolean programs

Alberto Moraglio, Krzysztof Krawiec
<span title="">2017</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/fdhfwmjdwjbvxo6zc7cdt5hi7q" style="color: black;">Proceedings of the Genetic and Evolutionary Computation Conference on - GECCO &#39;17</a> </i> &nbsp;
This work provides new insights into the relations between program syntax and semantics, search operators and tness landscapes, also for more general recursive domains.  ...  Geometric Semantic Genetic Programming (GSGP) induces a unimodal tness landscape for any problem that consists in nding a function tting given input/output examples.  ...  Higher order of recursions are obtained by recursive calls with successive tails of the input list.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/3071178.3071266">doi:10.1145/3071178.3071266</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/gecco/MoraglioK17.html">dblp:conf/gecco/MoraglioK17</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/th6oxptaubf4pfyzl5ixxyxibm">fatcat:th6oxptaubf4pfyzl5ixxyxibm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180722211028/https://ore.exeter.ac.uk/repository/bitstream/handle/10871/27415/chris6.pdf;jsessionid=F2D5ED3894E4F9093443508FA6874DEF?sequence=1" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/04/14/04144237b58d8c6d4d8c25c65fcf0cdf9465245b.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/3071178.3071266"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

A fully abstract denotational semantics for the calculus of higher-order communicating systems

B. Thomsen, S. Abramsky
<span title="">2001</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/elaf5sq7lfdxfdejhkqbtz6qoq" style="color: black;">Theoretical Computer Science</a> </i> &nbsp;
We present a construction of a denotational semantics for CHOCS which resides in a domain constructed using the standard constructions of separated sum, Cartesian product, the Plotkin power domain constructor  ...  and recursively deÿned domains.  ...  Acknowledgements Most of this work has been carried out on the Foundational Models for Software Engineering project (SERC GR-F 72475) while both authors worked at the Department of Computing, Imperial  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0304-3975(00)00281-4">doi:10.1016/s0304-3975(00)00281-4</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/swcukady4vhwdmbyihisthxpoa">fatcat:swcukady4vhwdmbyihisthxpoa</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20171002054645/http://publisher-connector.core.ac.uk/resourcesync/data/elsevier/pdf/b18/aHR0cDovL2FwaS5lbHNldmllci5jb20vY29udGVudC9hcnRpY2xlL3BpaS9zMDMwNDM5NzUwMDAwMjgxNA%3D%3D.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/a8/b4/a8b4939b0b1edc103ad93e23c72850fd813b475d.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0304-3975(00)00281-4"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Adding Weights to Constraints in Intelligent Tutoring Systems: Does It Improve the Error Diagnosis? [chapter]

Nguyen-Thinh Le, Niels Pinkwart
<span title="">2011</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
The constraint-based modeling (CBM) approach for developing intelligent tutoring systems has shown useful in several domains.  ...  First, we will show that classical CBM is not well-suited for building a tutoring system for tasks which have a large solution space.  ...  For instance, the tail recursive strategy can be implemented in many ways by varying the order of the two clauses or the order of the second and third subgoal in the second clause, by choosing one of two  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-23985-4_19">doi:10.1007/978-3-642-23985-4_19</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/7lynl65eybcuxchqszy5ofahea">fatcat:7lynl65eybcuxchqszy5ofahea</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170809062421/https://cses.informatik.hu-berlin.de/pubs/2011/ectel/adding_weights_to_constraints_in_intelligent_tutoring_systems_does_it_improve_the_error_diagnosis.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/14/c5/14c546297108a6fc150bd571db1df54bb5658c10.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-23985-4_19"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Three metric domains of processes for bisimulation [chapter]

Franck Breugel
<span title="">1994</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
(For a detailed overview of metric semantic models the reader is referred to BR92].)  ...  Aczel introduces in Acz88] a process domain for non-well-founded sets.  ...  Acknowledgements The author would like to thank Jaco de Bakker, Jan Rutten, and Fer-Jan de Vries for several discussions and their comments on a preliminary version of this paper.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-58027-1_5">doi:10.1007/3-540-58027-1_5</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/6h3hb47cv5gcvahlrq2v5cynk4">fatcat:6h3hb47cv5gcvahlrq2v5cynk4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180720222736/https://ir.cwi.nl/pub/5278/5278D.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/97/a6/97a69613a189a290f79dddfbbccbeff0ebdafde2.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-58027-1_5"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Page 2152 of Mathematical Reviews Vol. , Issue 86e [page]

<span title="">1986</span> <i title="American Mathematical Society"> <a target="_blank" rel="noopener" href="https://archive.org/details/pub_mathematical-reviews" style="color: black;">Mathematical Reviews </a> </i> &nbsp;
To this end axioms and inference rules for a theory of domain cat- egories are given.  ...  A.; Klop, J. W. 86e:68068 The algebra of recursively defined processes and the algebra of regular processes. Automata, languages and programming (Antwerp, 1984), 82-94, Lecture Notes in Comput.  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_1986-05_86e/page/2152" title="read fulltext microfilm" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Archive [Microfilm] <div class="menu fulltext-thumbnail"> <img src="https://archive.org/serve/sim_mathematical-reviews_1986-05_86e/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

Fixed Points in Metric Semantics

J.W. de Bakker
<span title="">2001</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/uy5mv2ncw5eahkdx47hkrglxmm" style="color: black;">Electronical Notes in Theoretical Computer Science</a> </i> &nbsp;
Furthermore, the denotational meaning function itself -say D, from language L to domain of meanings P -may be defined as (unique) fixed point of a higher-order mapping Psi : (L to P) to (L to P).  ...  Rather, we now define these operators as fixed points of higher order mappings.  ...  We conclude the list of basic building blocks for metric semantics with a few words on the metric approach to domain equations.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s1571-0661(05)80037-4">doi:10.1016/s1571-0661(05)80037-4</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/grrypvu2xzgdbpnt5szbnybo6u">fatcat:grrypvu2xzgdbpnt5szbnybo6u</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190413000928/https://core.ac.uk/download/pdf/82241091.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/a7/ed/a7eded93e331e7916c85f2f53fa057f7115ddb5a.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s1571-0661(05)80037-4"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> elsevier.com </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 46,434 results