Filters








2,225 Hits in 3.6 sec

Full abstraction, totality and PCF

GORDON PLOTKIN
1999 Mathematical Structures in Computer Science  
Inspired by a question of Riecke, we consider the interaction of totality and full abstraction, asking whether full abstraction holds for Scott's model of cpos and continuous functions if one restricts  ...  Analysing further, we consider sequential and parallel versions of PCF and several models: Scott's model of continuous functions, Milner's fully abstract model of PCF and their effective submodels.  ...  Acknowledgments I would like to thank Samson Abramsky for reawakening my interest in totality and domain theory, and Ulrich Berger, John Longley and Dag Normann for interesting and informative discussions  ... 
doi:10.1017/s0960129598002692 fatcat:kg4f66ts25budmwdb6hqsgr57q

Page 2923 of Mathematical Reviews Vol. , Issue 2000d [page]

2000 Mathematical Reviews  
Martin Hofmann (4-EDIN-C; Edinburgh) 2000d:68090 68Q55 06B35 Plotkin, Gordon (4-EDIN-C; Edinburgh) Full abstraction, totality and PCF. (English summary) Math. Structures Comput.  ...  Summary: “Inspired by a question of Riecke, we consider the interaction of totality and full abstraction, asking whether full ab- straction holds for Scott’s model of cpos and continuous functions if attention  ... 

Page 2048 of Mathematical Reviews Vol. , Issue 2003C [page]

2003 Mathematical Reviews  
The first is an intro- duction to the problem of the denotational semantics of PCF and to the problem of full abstraction.  ...  Part three contains the main results that solve the full abstraction problem for PCF.  ... 

Axioms for Definability and Full Completeness [article]

Samson Abramsky
2014 arXiv   pre-print
Axioms are presented which encapsulate the properties satisfied by categories of games which form the basis of results on full abstraction for PCF and other programming languages, and on full completeness  ...  Axioms are presented on models of PCF from which full abstraction can be proved.  ...  I am grateful to Guy McCusker and the two anonymous referees for their comments on the preliminary version of this paper.  ... 
arXiv:1401.4735v2 fatcat:kti4sxivinbqteeoxdcghmjvzm

Game theoretic analysis of call-by-value computation [chapter]

Kohei Honda, Nobuko Yoshida
1997 Lecture Notes in Computer Science  
We present a general semantic universe of call-by-value computation based on elements of game semantics, and validate its appropriateness as a semantic universe by the full abstraction result for call-by-value  ...  PCF, a generic typed programming language with call-by-value evaluation.  ...  We thank Samson Abramsky, Paul Mellies, Pasquale Malacaria, Guy McCusker, Jon Riecke and anonymous referees for comments and/or discussions, and N. Raja for his hospitality in Bombay.  ... 
doi:10.1007/3-540-63165-8_180 fatcat:dnl3jofkrrbmlfg3eydlmb2rii

Matching typed and untyped realizability

John Longley
1999 Electronical Notes in Theoretical Computer Science  
In this case, we h a ve a v ery good t indeed between the typed language and the untyped realizability m o d e l | w e r e f e r to this condition as (constructive) logical full abstraction.  ...  We g i v e some examples of this situation for a variety of extensions of PCF.  ...  Conditions for logical full abstraction We rst give some general conditions which su ce for logical full abstraction.  ... 
doi:10.1016/s1571-0661(04)00105-7 fatcat:6zp5v23rfjhkdow3vy7yyhaojy

Denotational Semantics with Nominal Scott Domains

Steffen Lösch, Andrew M. Pitts
2014 Journal of the ACM  
For both languages, we prove a full abstraction result for nominal Scott domains analogous to Plotkin's classic result about PCF and conventional Scott domains: two program phrases have the same observable  ...  To obtain full abstraction, we need to add two functionals, one for existential quantification over names and one for "definite description" over names.  ...  THEOREM 8.5 (FULL ABSTRACTION FOR λν-PCF + ).  ... 
doi:10.1145/2629529 fatcat:yhpbebcghbg7lamjef27y7z7bu

Full Abstraction and the Context Lemma

Trevor Jim, Albert R. Meyer
1996 SIAM journal on computing (Print)  
It is impossible to add a combinator to PCF to achieve full abstraction for models such a s Berry's stable domains in a way analogous to the addition of the parallel-or" combinator that achieves full abstraction  ...  A simple argument demonstrates that any denotational semantics that is adequate for PCF, and in which certain simple Boolean functionals exist, cannot be fully abstract for any extension of PCF satisfying  ...  As an aside, we also point out that it is questionable whether the bistable and similar domains are closer to full abstraction for PCF.  ... 
doi:10.1137/s0097539791224212 fatcat:dbtdasi7wrgk5ht7lj43qwu764

Page 2268 of Mathematical Reviews Vol. , Issue 94d [page]

1994 Mathematical Reviews  
He proved that this model is computationally adequate for PCF, but not fully abstract. “In order to obtain full abstraction he extended PCF by a parallel conditional operator.  ...  “Here we address the problem of full abstraction for the origi- nal sequential language PCF, i.e. instead of extending the language we try to improve the model.  ... 

Comparing Functional Paradigms for Exact Real-Number Computation [chapter]

Andrej Bauer, Martín Hötzel Escardó, Alex Simpson
2002 Lecture Notes in Computer Science  
We compare the definability of total functionals over the reals in two functional-programming approaches to exact real-number computation: the extensional approach, in which one has an abstract datatype  ...  are not needed for second-order types and below.  ...  A full investigation would show that the computable (and hence definable) total functionals coincide between the denotational interpretations of the extensional and intensional approaches.  ... 
doi:10.1007/3-540-45465-9_42 fatcat:2hnypgcb7fal7dvjfqj5yegdoq

Exact real number computations relative to hereditarily total functionals

Dag Normann
2002 Theoretical Computer Science  
is not deÿnable in Escardà o's Real-PCF from all functionals equivalent to a given total one in a uniform way.  ...  Let 1 and 2 be elements of T ( ). Let 1 ≈ 2 if 1 2 is in T ( ).  ...  Let be total and computable. Then there is a total equivalent to that is Real-PCF-deÿnable relative to S. A full proof would require several pages of text.  ... 
doi:10.1016/s0304-3975(01)00100-1 fatcat:77dpybvtqbfrjgbnv4xatsh7n4

Generalized Finite-Difference Time-Domain Method Utilizing Auxiliary Differential Equations for the Full-Vectorial Analysis of Photonic Crystal Fibers

Juan Juan Hu, Ping Shum, Chao Lu, Guobin Ren
2007 IEEE Photonics Technology Letters  
We present the generalized finite-difference time-domain full-vectorial method by reformulating the time-dependent Maxwell's curl equations with electric flux density and magnetic field intensity, with  ...  The model is generic and robust to treat general frequency-dependent material and nonlinear material.  ...  Hu, Ping Shum, Senior Member, IEEE, Chao Lu, Member, IEEE, and Guobin Ren Abstract-We present the generalized finite-difference time-domain full-vectorial method by reformulating the time-dependent Maxwell's  ... 
doi:10.1109/lpt.2007.909696 fatcat:hgutxyhdu5eglikyprpksi2dpu

Posterior Cervical Foraminotomy Via Full-Endoscopic Versus Microendoscopic Approach for Radiculopathy: A Systematic Review and Meta-analysis

Bing Wang
2019 Pain Physician  
Results: A total of 26 articles with 2003 patients (FE-PCF, 377; MI-PCF, 1626) were included.  ...  Objectives: To compare clinical success rate, overall incidence of complications and reoperation rate between full-endoscopic posterior cervical foraminotomy (FE-PCF) and microendoscopic posterior cervical  ...  flourishing in spine surgery, microendoscopic (MI) PCF was first reported by Adamson (11) in 2001 and full-endoscopic (FE) PCF by Ruetten et al (12) in 2007.  ... 
doi:10.36076/ppj/2019.22.41 fatcat:gfcbytcfa5ebfmgtxcdhdce22u

Pi-calculus, dialogue games and full abstraction PCF

J. M. E. Hyland, C.-H. L. Ong
1995 Proceedings of the seventh international conference on Functional programming languages and computer architecture - FPCA '95  
its date appear. and notice is given that copyright is by pemussIon of the .  ...  To copy olherwse. to repubiish,to post on servers or to redistribute to lists, requires specdic perrntssion and/or fee. FPCA '95 La Jolla, CA USAe 1995 ACIM 0-89791 -7/95/0006 ... S3.50  ...  We thank Pierre-Louis Curien for numerous insightful email and fax messages on game interpretation of PcF, and David Walker for most helpful comments on a draft of this paper.  ... 
doi:10.1145/224164.224189 dblp:conf/fpca/HylandO95 fatcat:wtbxr6b7c5dixhn2huts64hxde

Comparison of outcomes following minimally invasive and open posterior cervical foraminotomy: description of minimally invasive technique and review of literature

Andrew Platt, Carter S. Gerard, John E. O'Toole
2020 Journal of Spine Surgery  
and open posterior cervical foraminotomy and between MIS-PCF and percutaneous endoscopic (full-endoscopic) posterior cervical foraminotomy (FE-PCF).  ...  MIS-PCF and FE-PCF.  ...  Results In total 178 abstracts were reviewed of which 99 were excluded; 79 full text articles were assessed of which 39 were excluded.  ... 
doi:10.21037/jss.2020.01.08 pmid:32309662 pmcid:PMC7154358 fatcat:lnqne326abhf5g2h4texi2pa54
« Previous Showing results 1 — 15 out of 2,225 results