{"title":"A fully abstract semantics for concurrent graph reduction","authors":"A. Jeffrey","doi":"10.1109/LICS.1994.316084","DOIUrl":"https://doi.org/10.1109/LICS.1994.316084","url":null,"abstract":"This paper presents a fully abstract semantics for a variant of the untyped /spl lambda/-calculus with recursive [Bdeclarations. We first present a summary of existing work on full abstraction for the untyped /spl lambda/-calculus, concentrating on S. Abramsky (1989) and C.H.L. Ong (1988) work on the lazy /spl lambda/-calculus. Abramsky and Ong's work is based on leftmost outermost reduction without sharing. This is notably inefficient, and many implementations model share by reducing syntax graphs rather than syntax trees. Here we present a concurrent graph reduction algorithm for the /spl lambda/-calculus with recursive declarations, in a style similar to G. Berry and G. Boudol's chemical abstract machine. We adapt Abramsky and Ong's techniques, and present a program logic and denotational semantics for the /spl lambda/-calculus with recursive declarations, and show that the three semantics are equivalent.<<ETX>>","PeriodicalId":302290,"journal":{"name":"Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116631295","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":"Proof search in first-order linear logic and other cut-free sequent calculi","authors":"P. Lincoln, N. Shankar","doi":"10.1109/LICS.1994.316061","DOIUrl":"https://doi.org/10.1109/LICS.1994.316061","url":null,"abstract":"We present a general framework for proof search in first-order cut-free sequent calculi and apply it to the specific case of linear logic. In this framework, Herbrand functions are used to encode universal quantification, and unification is used to instantiate existential quantifiers so that the eigenvariable conditions are respected. We present an optimization of this procedure that exploits the permutabilities of the subject logic. We prove the soundness and completeness of several related proof search procedures. This proof search framework is used to show that provability for first-order MALL is in NEXPTIME, and first-order MLL is in NP. Performance comparisons based on Prolog implementations of the procedures are also given. The optimization of the quantifier steps in proof search can be combined effectively with a number of other optimizations that are also based on permutability.<<ETX>>","PeriodicalId":302290,"journal":{"name":"Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science","volume":"2002 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131201384","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":"A non-elementary speed-up in proof length by structural clause form transformation","authors":"M. Baaz, C. Fermüller, A. Leitsch","doi":"10.1109/LICS.1994.316070","DOIUrl":"https://doi.org/10.1109/LICS.1994.316070","url":null,"abstract":"We investigate the effects of different types of translations of first-order formulas to clausal form on minimal proof length. We show that there is a sequence of unsatisfiable formulas such that the length of all refutations of non-structural clause forms of F/sub n/ is non-elementary (in the size of F/sub n/), but there are refutations of structural clause forms of F/sub n/ that are of elementary (at most triple exponential) length.<<ETX>>","PeriodicalId":302290,"journal":{"name":"Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science","volume":"460 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124349743","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":"The declarative semantics of the Prolog selection rule","authors":"Robert F. Stark","doi":"10.1109/LICS.1994.316064","DOIUrl":"https://doi.org/10.1109/LICS.1994.316064","url":null,"abstract":"We axiomatize the Prolog selection rule which always selects the leftmost literal in a goal. We introduce a new completion of a logic program which we call the l-completion of the program. The l-completion is formulated as a first-order theory in a language extended by new predicate symbols which express success, failure and left-termination of queries. The main results of the paper are the following. If a query succeeds, fails or is left-terminating under the Prolog selection rule, then the corresponding formula in the extended language is provable from the l-completion. Conversely, if a logic program and a query are correct with respect to some mode assignment and if one can prove in the l-completion that the query succeeds and is left-terminating, then the goal is successful and Prolog, using its depth first search, will compute an answer substitution for the goal. This result can even be extended to so called non-floundering queries.<<ETX>>","PeriodicalId":302290,"journal":{"name":"Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122770069","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":"Linear logic, totality and full completeness","authors":"R. Loader","doi":"10.1109/LICS.1994.316060","DOIUrl":"https://doi.org/10.1109/LICS.1994.316060","url":null,"abstract":"I give a 'totality space' model for linear logic [4] derived by taking an abstract view of computations on a datatype. The model has similarities with both the coherence space model and game-theoretic models, but is based upon a notion of total object. Using this model, I prove a full completeness result. In other words, I show that the mapping of proofs to their interpretations (here collections of total objects uniform for a given functor) in the model is a surjection.<<ETX>>","PeriodicalId":302290,"journal":{"name":"Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123047192","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":"Linear types, approximation, and topology","authors":"M. Huth, A. Jung, K. Keimel","doi":"10.1109/LICS.1994.316081","DOIUrl":"https://doi.org/10.1109/LICS.1994.316081","url":null,"abstract":"We enrich the *-autonomous category of complete lattices and maps preserving all suprema with the important concept of approximation by specifying a *-autonomous full subcategory LFS of linear FS-lattices. This is the greatest *-autonomous full subcategory of linked bicontinuous lattices. The modalities !() and ?() mediate a duality between the upper and lower powerdomains. The distributive objects in LFS give rise to the compact closed *-autonomous full subcategory CD of completely distributive lattices. We characterise algebraic objects in LFS by forbidden substructures 'a la Plotkin'.<<ETX>>","PeriodicalId":302290,"journal":{"name":"Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116014692","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":"Normalised rewriting and normalised completion","authors":"C. Marché","doi":"10.1109/LICS.1994.316050","DOIUrl":"https://doi.org/10.1109/LICS.1994.316050","url":null,"abstract":"Introduces normalised rewriting, a new rewrite relation. It generalises former notions of rewriting modulo E, dropping some conditions on E. For example, E can now be the theory of identity, idempotency, the theory of Abelian groups, or the theory of commutative rings. We give a new completion algorithm for normalised rewriting. It contains as an instance the usual AC completion algorithm (AC being the set of equations containing the associativity and commutativity axioms), but also the well-known Buchberger's algorithm for computing standard bases of polynomial ideals. We investigate the particular case of completion of ground equations. In this case, we prove by a uniform method that completion modulo E terminates, for some interesting E. As a consequence, we obtain the decidability of the word problem for some classes of equational theories. We give implementation results which show the efficiency of normalised completion with respect to completion modulo AC.<<ETX>>","PeriodicalId":302290,"journal":{"name":"Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127068002","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":"Cyclic lambda graph rewriting","authors":"Z. M. Ariola, J. Klop","doi":"10.1109/LICS.1994.316066","DOIUrl":"https://doi.org/10.1109/LICS.1994.316066","url":null,"abstract":"Studies cyclic /spl lambda/-graphs. The starting point is to treat a /spl lambda/-graph as a system of recursion equations involving /spl lambda/-terms, and to manipulate such systems in an unrestricted manner, using equational logic, just as is possible for first-order term rewriting. Surprisingly, now the confluence property breaks down in an essential way. Confluence can be restored by introducing a restraining mechanism on the 'copying' operation. This leads to a family of /spl lambda/-graph calculi, which are inspired by the family of /spl lambdaspl sigma/-calculi (/spl lambda/-calculi with explicit substitution). However, these concern acyclic expressions only. In this paper we are not concerned with optimality questions for acyclic /spl lambda/-reduction. We also indicate how Wadsworth's (1978) interpreter can be simulated in the /spl lambda/-graph rewrite rules that we propose.<<ETX>>","PeriodicalId":302290,"journal":{"name":"Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123684495","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":"Logical bilattices and inconsistent data","authors":"O. Arieli, A. Avron","doi":"10.1109/LICS.1994.316044","DOIUrl":"https://doi.org/10.1109/LICS.1994.316044","url":null,"abstract":"The notion of a bilattice was first proposed by Ginsberg (1988) as a general framework for many applications. This notion was further investigated and applied for various goals by Fitting (1989, 1990, 1991, 1993). In this paper, we develop proof systems which correspond to bilattices in an essential way. We then show how to use those bilattices for efficient inferences from possibly inconsistent data. For this, we incorporate certain ideas of Kifer and Lozinskii (1992) concerning inconsistencies, which happen to well suit the framework of bilattices. The outcome is a paraconsistent logic with many desirable properties.<<ETX>>","PeriodicalId":302290,"journal":{"name":"Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121607013","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":"Higher-order narrowing","authors":"C. Prehofer","doi":"10.1109/LICS.1994.316040","DOIUrl":"https://doi.org/10.1109/LICS.1994.316040","url":null,"abstract":"Introduces several approaches for solving higher-order equational problems by higher-order narrowing, and gives some completeness results. The results apply to higher-order functional-logic programming languages and to higher-order unification modulo a higher-order equational theory. We lift the general notion of first-order narrowing to so-called higher-order patterns and argue that the full higher-order case is problematic. Integrating narrowing into unification (called 'lazy narrowing') can avoid these problems and can be adapted to the full higher-order case. For the second-order case, we develop a version where the needed second-order unification remains decidable. Finally, we discuss a method that combines both approaches by using narrowing on higher-order patterns with full higher-order constraints.<<ETX>>","PeriodicalId":302290,"journal":{"name":"Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science","volume":"293 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122086986","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}