[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science

19-23 June 1993

Filter Results

Displaying Results 1 - 25 of 42
  • Lambek grammars are context free

    Publication Year: 1993, Page(s):429 - 433
    Cited by:  Papers (25)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (366 KB)

    Basic categorial grammars are the context-free ones. Another kind of categorial grammars was introduced by J. Lambek (1958). These grammars are based on a syntactic calculus, known as the Lambek calculus. Chomsky (1963) conjectured that these grammars are also equivalent to context-free ones. Every basic categorial grammar (and thus every context-free grammar) is equivalent to a Lambek grammar. Co... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bisimulation and open maps

    Publication Year: 1993, Page(s):418 - 427
    Cited by:  Papers (24)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (852 KB)

    An abstract definition of bisimulation is presented. It allows a uniform definition of bisimulation across a range of different models for parallel computation presented as categories. As examples, transition systems, synchronization trees, transition systems with independence (an abstraction from Petri nets), and labeled event structures are considered. On transition systems, the abstract definit... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Self-synchronization of concurrent processes

    Publication Year: 1993, Page(s):409 - 417
    Cited by:  Papers (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (644 KB)

    Introduces a unary "self-synchronization" operation on concurrent processes that synchronizes concurrent transitions within a process. Standard parallel synchronization and communicating action refinement operations can be reduced to simple combinations of self-synchronization and unsynchronized noncommunicating operations. Modifying familiar fully abstract process semantics, so that actions are r... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A fully abstract denotational model for higher-order processes

    Publication Year: 1993, Page(s):397 - 408
    Cited by:  Papers (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (913 KB)

    A higher-order process calculus is defined in which one can describe processes which transmit as messages other processes; it may be viewed as a generalization of the lazy lambda -calculus. The authors present a denotational model for the language, obtained by generalizing the domain equation for S. Abramsky's (1990) model of the lazy lambda -calculus. It is shown to be fully abstract with respect... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Decomposability, decidability and axiomatisability for bisimulation equivalence on basic parallel processes

    Publication Year: 1993, Page(s):386 - 396
    Cited by:  Papers (14)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (843 KB)

    The authors prove the decidability of two subclasses of recursive processes involving a parallel composition operator with respect to bisimulation equivalence, namely, the so-called normed and live processes. To accomplish this, the authors first prove a unique decomposition result for (a generalization of) normed processes, in order to deduce a necessary cancellation law. The decidability proof l... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Typing and subtyping for mobile processes

    Publication Year: 1993, Page(s):376 - 385
    Cited by:  Papers (56)  |  Patents (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (896 KB)

    The pi -calculus is a process algebra that supports process mobility by focusing on the communication of channels. R. Milner's (1991) presentation of the pi -calculus includes a type system assigning arities to channels and enforcing a corresponding discipline in their use. The authors extend Milner's language of types by distinguishing between the ability to read from a channel, the ability to wr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Type theory and recursion

    Publication Year: 1993
    Cited by:  Papers (4)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (104 KB)

    Summary form only given. Type theory and recursion are analyzed in terms of intuitionistic linear type theory. This is compatible with a general recursion operator for the intuitionistic functions. The author considers second-order intuitionistic linear type theory whose primitive type constructions are linear and intuitionistic function types and second-order quantification.<<ETX>> View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The unifiability problem in ground AC theories

    Publication Year: 1993, Page(s):364 - 370
    Cited by:  Papers (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (558 KB)

    It is shown that unifiability is decidable in theories presented by a set of ground equations with several associative-communicative symbols (ground AC theories). This result applies, for instance, to finitely presented commutative semigroups, and it extends the authors' previous work (P. Narendran and M. Rusinwithch, 1991) where they gave an algorithm for solving the uniform word problem in groun... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The order types of termination orderings on monadic terms, strings and multisets

    Publication Year: 1993, Page(s):356 - 363
    Cited by:  Papers (8)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (660 KB)

    Total well-founded orderings on monadic terms satisfying the replacement and full invariance properties are considered. It is shown that any such ordering on monadic terms in one variable and two unary function symbols must have order type omega , omega /sup 2/, or omega /sup omega /. It is further shown that a familiar construction gives rise to continuum many such orderings of order type omega .... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Homomorphic tree embeddings and their applications to recursive program optimization

    Publication Year: 1993, Page(s):344 - 353
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (903 KB)

    The problems of stage-preserving linearization and one-boundedness are studied for a class of nonlinear single rule recursive programs, and syntactic characterizations are developed for both. The characterizations lead to a polynomial-time algorithm for the former and a linear-time algorithm for the latter. Stage-preserving linearization results in a significant improvement in evaluation efficienc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Database query languages embedded in the typed lambda calculus

    Publication Year: 1993, Page(s):332 - 343
    Cited by:  Papers (5)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (973 KB)

    It is shown how to naturally embed, in the typed lambda -calculus with equality, many database query languages, including the relational calculus/algebra, inflationary Datalog, and the complex object calculus/algebra. The embeddings considered are such that a database is a lambda -term coding list of tuples and a query is a lambda -term which when applied to the input database normalizes to the ou... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Some desirable conditions for feasible functionals of type 2

    Publication Year: 1993, Page(s):320 - 331
    Cited by:  Papers (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (1091 KB)

    We consider functionals of type 2 as transformers between functions of type 1. An intuitively feasible functional must preserve the complexity of the input function in some broad sense. We show that the well quasi-order functional, which has been proposed by S.A. Cook (1990) as being intuitively feasible, fails to preserve the class of Kalmar elementary functions. For the basic feasible functional... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An exponential separation between the matching principle and the pigeonhole principle

    Publication Year: 1993, Page(s):308 - 319
    Cited by:  Papers (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (935 KB)

    The combinatorial matching principle states that there is no perfect matching on an odd number of vertices. This principle generalizes the pigeonhole principle, which states that for a fixed bipartition of the vertices, there is no perfect matching between them. Therefore, it follows from recent lower bounds for the pigeonhole principle that the matching principle requires exponential-size bounded... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Local and asynchronous beta-reduction (an analysis of Girard's execution formula)

    Publication Year: 1993, Page(s):296 - 306
    Cited by:  Papers (3)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (781 KB)

    The authors build a confluent, local, asynchronous reduction on lambda -terms, using infinite objects (partial injections of Girard's (1988) algebra L*), which is simple (only one move), intelligible (semantic setting of the reduction), and general (based on a large-scale decomposition of beta ), and may be mechanized.<<ETX>> View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adequacy for untyped translations of typed lambda -calculi

    Publication Year: 1993, Page(s):287 - 295
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (650 KB)

    PCF is a simply typed lambda -calculus with ground types iota (natural numbers) and omicron (Booleans); there are no type variables and implies is the only type constructor. There is a natural way to translate any PCF term t into an untyped lambda -expression Lambda (t), such that if t is a program, i.e. a closed term of ground type (say integer type) and t implies /sub N/ n then Lambda (t) implie... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Non-determinism in a functional setting

    Publication Year: 1993, Page(s):275 - 286
    Cited by:  Papers (7)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (806 KB)

    The pure untyped lambda calculus augmented with an (erratic) choice operator is considered as an idealised nondeterministic functional language. Both the 'may' and the 'must' modalities of convergence are of interest. Following Abramsky's (1991) work on domain theory in logical form, we identify the denotational type that captures the computational situation delta =P(( delta to delta ) perpendicul... View full abstract»

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

    Publication Year: 1993, Page(s):262 - 274
    Cited by:  Papers (7)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (800 KB)

    The theory of programming with pattern-matching function definitions has been studied mainly in the framework of first-order rewrite systems. The authors present a typed functional calculus that emphasizes the strong connection between the structure of whole pattern definitions and their types. In this calculus, type-checking guarantees the absence of runtime errors caused by nonexhaustive pattern... View full abstract»

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

    Publication Year: 1993, Page(s):252 - 260
    Cited by:  Papers (8)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (892 KB)

    The view that computers are information processors is commonplace. They are used, for the most part successfully, throughout our society, as reliable links in the transmission of information and knowledge. Yet the formulation of a precise, qualitative conception of information and a theory of the transmission of information has proved elusive, despite the many other successes of computer science. ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Programs, grammars and arguments: a personal view of some connections between computation, language and logic

    Publication Year: 1993, Page(s):246 - 249
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (291 KB)

    The question of what is an effective process or algorithm arose form the statement of Hilbert's tenth problem. It was soon seen to be related to the question of which numerical functions N/sup n/ to N are computable. Among the early answers to this question the author singles out three. A numerical function is computable if and only if it is recursive, it is computable on a Turing machine, or it i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Encoding the calculus of constructions in a higher-order logic

    Publication Year: 1993, Page(s):233 - 244
    Cited by:  Papers (4)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (1074 KB)

    The author presents an encoding of the calculus of constructions (CC) in a higher-order intuitionistic logic (I) in a direct way, so that correct typing in CC corresponds to intuitionistic provability in a sequent calculus for I. In addition, she demonstrates a direct correspondence between proofs in these two systems. The logic I is an extension of hereditary Harrop formulas (hh), which serve as ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Rules of definitional reflection

    Publication Year: 1993, Page(s):222 - 232
    Cited by:  Papers (19)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (845 KB)

    The author discusses two rules of definitional reflection: the logical version of definitional reflection, as used in the extended logic programming language GCLA, and the omega version of definitional reflection. The logical version is a left-introduction rule completely analogous to the left-introduction rules for logical operators in Gentzen-style sequent systems, whereas the omega version exte... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Compositional analysis for concurrent constraint programming

    Publication Year: 1993, Page(s):210 - 221
    Cited by:  Papers (6)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (727 KB)

    A framework for the analysis of concurrent constraint programming (CCP) is proposed. The approach is based on simple denotational semantics that approximate the usual semantics in the sense that they give a superset of the input-output relation of a CCP program. Analyses based on these semantics can be easily and efficiently implemented using standard techniques from the analysis of logic programs... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Asymptotic probabilities of languages with generalized quantifiers

    Publication Year: 1993, Page(s):199 - 207
    Cited by:  Papers (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (720 KB)

    The impact of adding certain families of generalized quantifiers to first-order logic (FO) on the asymptotic behavior of sentences is studied. All the results are stated and proved for languages disallowing free variables in the scope of generalized quantifiers. For a class K of finite structures closed under isomorphism, the quantifier Q/sub K/ is said to be strongly monotonic, sm, if membership ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Infinitary logics and very sparse random graphs

    Publication Year: 1993, Page(s):191 - 198
    Cited by:  Papers (4)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (561 KB)

    The infinitary language obtained from the first-order language of graphs by closure under conjunctions and disjunctions of arbitrary sets of formulas, provided only finitely many distinct variables occur among the formulas, is considered. Let p(n) be the edge probability of the random graph on n vertices. It is shown that if p(n)<<n/sup -1/, then for every sigma belonging to the infinitary l... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Monadic second-order logic and hypergraph orientation

    Publication Year: 1993, Page(s):179 - 190
    Cited by:  Papers (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (1057 KB)

    It is proved that in every undirected graph or, more generally, in every undirected hypergraph of bounded rank, one can specify an orientation of the edges or hyperedges by monadic second-order formulas using quantifications on sets of edges or hyperedges. The proof uses an extension to hypergraphs of the classical notion of a depth-first search spanning tree. Applications are given to the partial... View full abstract»

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