{"title":"IO vs OI in Higher-Order Recursion Schemes","authors":"A. Haddad","doi":"10.4204/EPTCS.77.4","DOIUrl":"https://doi.org/10.4204/EPTCS.77.4","url":null,"abstract":"We propose a study of the modes of derivation of higher-order recursion schemes, proving that value trees obtained from schemes using innermost-outermost derivations (IO) are the same as those obtained using unrestricted derivations. Given that higher-order recursion schemes can be used as a model of functional programs, innermost-outermost derivations policy represents a theoretical view point of call by value evaluation strategy.","PeriodicalId":119563,"journal":{"name":"Fixed Points in Computer Science","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-02-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122607348","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Model-Checking the Higher-Dimensional Modal mu-Calculus","authors":"M. Lange, É. Lozes","doi":"10.4204/EPTCS.77.6","DOIUrl":"https://doi.org/10.4204/EPTCS.77.6","url":null,"abstract":"The higher-dimensional modal -calculus is an extension of the -calculus that has been introduced by Otto. The fascinating fea- ture of this extension is that it precisely characterizes the bisimulation- invariant polynomial-time properties over nite structures. In this paper we investigate how the model checking problem of the higher-dimensional modal -calculus can be eciently implemented. We propose two al- gorithms, based on extensions of local model checking and symbolic model checking algorithms respectively. We then illustrate the poten- tial strength of these generic algorithms for deciding specic problems of various elds, as process equivalences, automata theory, parsing, string problems, or games.","PeriodicalId":119563,"journal":{"name":"Fixed Points in Computer Science","volume":"1982 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-02-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125449713","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"An Easy Completeness Proof for the Modal mu-Calculus on Finite Trees","authors":"B. T. Cate, G. Fontaine","doi":"10.1007/978-3-642-12032-9_12","DOIUrl":"https://doi.org/10.1007/978-3-642-12032-9_12","url":null,"abstract":"","PeriodicalId":119563,"journal":{"name":"Fixed Points in Computer Science","volume":"110 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132070963","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"An Abstract Monadic Semantics for Value Recursion","authors":"E. Moggi, A. Sabry","doi":"10.1051/ita:2004018","DOIUrl":"https://doi.org/10.1051/ita:2004018","url":null,"abstract":"This paper proposes an operational semantics for value recursion in the context of monadic metalanguages. Our technique for combining value recursion with computational effects works uniformly for all monads. The operational nature of our approach is related to the implementation of recursion in Scheme and its monadic version proposed by Friedman and Sabry, but it defines a different semantics and does not rely on assignments. When contrasted to the axiomatic approach proposed by Erkok and Launchbury, our semantics for the continuation monad invalidates one of the axioms, adding to the evidence that this axiom is problematic in the presence of continuations.","PeriodicalId":119563,"journal":{"name":"Fixed Points in Computer Science","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115545366","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Fixed points on abstract structures without the equality test","authors":"M. Korovina","doi":"10.7146/BRICS.V9I26.21742","DOIUrl":"https://doi.org/10.7146/BRICS.V9I26.21742","url":null,"abstract":"In this paper we present a study of definability properties of fixed points of effective operators on abstract structures without the equality test. In particular we prove that Gandy theorem holds for abstract structures. This provides a useful tool for dealing with recursive definitions using Sigma-formulas. One of the applications of Gandy theorem in the case of the reals without the equality test is that it allows us to define universal Sigma-predicates. It leads to a topological characterisation of Sigma-relations on |R.","PeriodicalId":119563,"journal":{"name":"Fixed Points in Computer Science","volume":"91 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123973093","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"On Characteristic Formulae for Event-Recording Automata","authors":"Omer Nguena-Timo, P. Reynier","doi":"10.1051/ita/2012029","DOIUrl":"https://doi.org/10.1051/ita/2012029","url":null,"abstract":"A standard bridge between automata theory and logic is provided by the notion of\u0000 characteristic formula. This paper investigates this problem for the class of\u0000 event-recording automata (ERA), a subclass of timed automata in which clocks are\u0000 associated with actions and that enjoys very good closure properties. We first study the\u0000 problem of expressing characteristic formulae for ERA in Event-Recording Logic (ERL ), a\u0000 logic introduced by Sorea to express event-based timed specifications. We prove that the\u0000 construction proposed by Sorea for ERA without invariants is incorrect. More generally, we\u0000 prove that timed bisimilarity cannot in general be expressed in ERL for the class of ERA ,\u0000 and study under which conditions on ERA it can be. Then, we introduce the logic\u0000 WT μ , a new logic for event-based timed specifications\u0000 closer to the timed logic ℒ ν that was introduced by\u0000 Laroussinie, Larsen and Weise. We prove that it is strictly more expressive than ERL , and\u0000 that its model-checking problem against ERA is EXPTIME -complete. Finally, we provide\u0000 characteristic formulae constructions in WT μ for\u0000 characterizing the general class of ERA up to timed (bi)similarity and study the\u0000 complexity issues.","PeriodicalId":119563,"journal":{"name":"Fixed Points in Computer Science","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114235835","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
求助内容：
应助结果提醒方式：