[1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science

4-7 June 1990

Filter Results

Displaying Results 1 - 25 of 47
  • Type reconstruction in finite-rank fragments of the polymorphic lambda -calculus

    Publication Year: 1990, Page(s):2 - 11
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (587 KB)

    It is proven that the problem of type reconstruction in the polymorphic lambda -calculus of rank two is polynomial-time equivalent to the problem of type reconstruction in ML, and is therefore DEXPTIME-complete. It is also proven that for every k>2, the problem of type reconstruction in the polymorphic lambda -calculus of rank k, extended with suitably chosen constants with types of rank one, i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Polymorphism, set theory, and call-by-value

    Publication Year: 1990, Page(s):12 - 18
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (498 KB)

    Set-theoretic (or rather the more general topos-theoretic) models of polymorphic lambda-calculi are discussed under the assumption that the datatypes of the language are to be interpreted as sets and the operations as partial functions. It is shown that it is not possible to obtain a model in which function spaces are interpreted by the full partial function space, but that it is nevertheless poss... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Universal domains in the theory of denotational semantics of programming languages

    Publication Year: 1990, Page(s):19 - 34
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1087 KB)

    The authors present a categorical generalization of a well-known result in model theory, the Fraisse-Jonsson theorem, by which they characterize large classes of reasonable categories if they contain universal homogeneous objects. As a first application, they derive from this, for various categories of bifinite domains and with embedding-projection pairs as morphisms, the existence and uniqueness ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The classification of continuous domains

    Publication Year: 1990, Page(s):35 - 40
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (434 KB)

    The long-standing problem of finding the maximal Cartesian closed categories of continuous domains is solved. The solution requires the definition of a new class of continuous domains, called FS-domains, which contains all retracts of SFP-objects. The properties of FS-domains are discussed.<<ETX>> View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A decision procedure for a class of set constraints

    Publication Year: 1990, Page(s):42 - 51
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (722 KB)

    A set constraint is of the form exp/sub 1/ contains exp/sub 2/ where exp/sub 1/ and exp/sub 2/ are set expressions constructed using variables, function symbols, projection symbols, and the set union, intersection, and complement symbols. While the satisfiability problem for such constraints is open, restricted classes have been useful in program analysis. The main result is a decision procedure f... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A constraint sequent calculus

    Publication Year: 1990, Page(s):52 - 61
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (698 KB)

    An axiomatic approach that accounts for examples that come up in logic programming, symbolic computation, affine geometry, and elsewhere is presented. It is shown that if disjunction behaves in an intuitionistic fashion, notions of canonical form for positive constraints can be systematically extended to include negative constraints. As a consequence, completeness theorems involving positive and n... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Solving inequations in terms algebras

    Publication Year: 1990, Page(s):62 - 69
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (561 KB)

    Let T be the theory of term algebra over the relational symbols = or >or=, where >or= is interpreted as a lexicographic path ordering. The decidability of the purely existential fragment of T is shown. The proof is carried out in three steps. The first step consists of the transformation of any quantifier-free formula phi (i.e. all variables are free) into a solved form that has the same set... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The dynamic logic of permission

    Publication Year: 1990, Page(s):72 - 78
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (635 KB)

    Intelligent legal information systems require the ability to represent two different notions of permission, one of which, free choice permission, cannot be adequately represented in standard modal logics. A logic that handles this modality by using ideas from dynamic logic is defined. The main result is the completeness of an axiomatization of the logic.<<ETX>> View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A theory of nonmonotonic rule systems

    Publication Year: 1990, Page(s):79 - 94
    Cited by:  Papers (3)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1500 KB)

    The semantics for nonmonotonic rule systems are investigated. The notion of nonmonotonic formal systems is then introduced. Examples are given, along with applications of logic, logic programming, and common-sense reasoning.<<ETX>> View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The semantics of reflected proof

    Publication Year: 1990, Page(s):95 - 105
    Cited by:  Papers (8)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (985 KB)

    The authors lay the foundations for reasoning about proofs whose steps include both invocations of programs to build subproofs (tactics) and references to representations of proofs themselves (reflected proofs). The main result is the definition of a single type of proof which can mention itself, using a novel technique which finds a fixed point of a mapping between metalanguage and object languag... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Equation solving using modal transition systems

    Publication Year: 1990, Page(s):108 - 117
    Cited by:  Papers (50)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (766 KB)

    This research offers as its main contribution a complete treatment of equation solving within process algebra for equation systems of the following form: C/sub 1/(X) approximately P/sub 1/, . . ., C/sub n(X)/ approximately P/sub n/ where C/sub i/ are arbitrary contexts (i.e. derived operators) of some process algebra, P/sub i/ are arbitrary process (i.e. terms of the process algebra), approximatel... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Three logics for branching bisimulation

    Publication Year: 1990, Page(s):118 - 129
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (804 KB)

    Three temporal logics are introduced which induce on labeled transition systems the same identifications as branching bisimulation. The first is an extension of Hennessy-Milner logic with a kind of unit operator. The second is another extension of Hennessy-Milner logic which exploits the power of backward modalities. The third is CTL* with the next-time operator interpreted over all paths, not jus... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reactive, generative, and stratified models of probabilistic processes

    Publication Year: 1990, Page(s):130 - 141
    Cited by:  Papers (40)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (835 KB)

    Reactive, generative, and stratified models are considered within the framework of PCCS, a specification language for probabilistic processes. A structural operational semantics of PCCS, given as a set of inference rules for each of the models, a notion of bisimulation semantics, and some conference proofs are presented.<<ETX>> View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The nonexistence of finite axiomatisations for CCS congruences

    Publication Year: 1990, Page(s):142 - 153
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (796 KB)

    Equatorial axiomatizations for congruences over a simple sublanguage of R. Milner's (1980) process algebra CCS (calculus of communicating systems) are examined. It is shown that no finite set of equational axioms can completely characterize any reasonably defined congruence which is at least as strong as Milner's strong congruence. In the case of strong congruence, this means that the expansion th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • 0-1 laws for infinitary logics

    Publication Year: 1990, Page(s):156 - 167
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (914 KB)

    Asymptotic probabilities of properties expressible in a certain infinitary logic on finite structures are investigated. Sentences in this logic may have arbitrary disjunctions and conjunctions, but they involve only a finite number of distinct variables. It is shown that zero-one law holds for the infinitary logic considered, i.e. the asymptotic probability of every sentence in this logic exists a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Implicit definability on finite structures and unambiguous computations

    Publication Year: 1990, Page(s):168 - 180
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (957 KB)

    The expressive power and the computational strength of first-order implicit definability on finite structures are studied. It is shown that every fixpoint query is a member of an implicitly definable pair of queries on finite structures. This turns out to be an optimal result, since in addition it is proven that there are natural fixpoint queries that are not implicitly definable on finite structu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • ALOGTIME and a conjecture of S.A. Cook

    Publication Year: 1990, Page(s):181 - 189
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (622 KB)

    Using sequential, machine-independent characterizations of the parallel complexity classes AC/sup k/ and NC/sup k/, the author establishes a conjecture of S.A. Cook (1975) regarding polynomial size Frege proofs for a certain infinite family. A related result is established with constant formula-depth polynomial size Frege proofs for a system AV related to uniform AC/sup 0/ functions.<<ETX>... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the expression of monadic second-order graph properties without quantifications over sets of edges

    Publication Year: 1990, Page(s):190 - 196
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (476 KB)

    For graphs of degree at most some fixed integer, the same properties can be expressed by monadic second-order formulas with and without quantifications over sets of edges, with and without auxiliary orientations. Similar results hold for partial k-trees for fixed k, and for graphs of tree-width at most k. These results are related to the possibility of testing graph properties in polynomial time f... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Normal process representatives

    Publication Year: 1990, Page(s):200 - 207
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (560 KB)

    The relevance of a form of cut elimination theorem for linear logic tensor theories to the concept of a process on a Petri net is discussed. The discussion is based on two definitions of processes given by E. Best and R. Devillers (1987). Their notions of process correspond to equivalence relations on linear logic proofs. It is noted that the cut reduced proofs form a process under the finer of th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A categorical linear framework for Petri nets

    Publication Year: 1990, Page(s):208 - 218
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (759 KB)

    This research brings together, in a methodical way, several approaches to giving a compositional theory of Petri nets using category theory and to the use of linear logic in specifying and reasoning about Petri nets. The authors construct categories of nets based on V.C.V. de Paiva's dialectica category models (1989) of linear logic in which they are able to exploit the structure of de Paiva's mod... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A linear semantics for allowed logic programs

    Publication Year: 1990, Page(s):219 - 227
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (541 KB)

    A declarative semantics for the class of allowed logic programs is proposed. Such a semantics is a logical theory, the linear completion of the program P, which differs from Clark's completion because the underlying logic is linear logic rather than classical logic. With respect to such a semantics, the soundness and completeness of SLDNF-resolution is proven. That is, it is proven that the comput... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Programming in equational logic: beyond strong sequentiality

    Publication Year: 1990, Page(s):230 - 241
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1036 KB)

    The authors consider whether it is possible to devise a complete normalization algorithm that minimizes (rather than eliminates) the wasteful reductions for the entire class of regular systems. A solution is proposed to this problem using the concept of a necessary set of redexes. In such a set, at least one of the redexes must be reduced to normalize a term. An algorithm is devised to compute a n... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The theory of ground rewrite systems is decidable

    Publication Year: 1990, Page(s):242 - 248
    Cited by:  Papers (30)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (541 KB)

    Using tree automata techniques, it is proven that the theory of ground rewrite systems is decidable. Novel decision procedures are presented for most classic properties of ground rewrite systems. An example is presented to illustrate how these results could be used for specification and debugging.<<ETX>> View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Well rewrite orderings

    Publication Year: 1990, Page(s):249 - 256
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (583 KB)

    A study is made of well (quasi) orderings which are described as rewrite orderings, and a family of well (quasi) orderings that extends the embedding or divisibility order of G. Higman (1952) is presented. For instance, the well (quasi) orderings proposed by the author may contain pairs of the form f(f(x))>f(g(f(x))). Conditions under which the transitive closures of a well-founded relation is ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A constructive proof of Higman's lemma

    Publication Year: 1990, Page(s):257 - 267
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (663 KB)

    G. Higman's lemma (1952) is a special case of the more general Kruskal's tree embedding theorem and the graph minor theorem. A direct constructive proof of the lemma with manifest computational content is presented. This is done by reducing the problem to a construction of certain sets of sequential regular expressions. A well-founded order on such sets is exhibited, and the lemma then follows by ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.