Search Results - "[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science"

Functional unification of higher-order patterns by Nipkow, T.

“…The complete development of a unification algorithm for so-called higher-order patterns, a subclass of lambda -terms, is presented. The starting point is a…”
Get full text

Set constraints are the monadic class by Bachmair, L., Ganzinger, H., Waldmann, U.

“…The authors investigate the relationship between set constraints and the monadic class of first-order formulas and show that set constraints are essentially…”
Get full text

Lambek grammars are context free by Pentus, M.

“…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…”
Get full text

Rules of definitional reflection by Schroeder-Heister, P.

“…The author discusses two rules of definitional reflection: the logical version of definitional reflection, as used in the extended logic programming language…”
Get full text

Typing and subtyping for mobile processes by Pierce, B., Sangiorgi, D.

“…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…”
Get full text

Type theory and recursion by Plotkin, G.D.

“…Summary form only given. Type theory and recursion are analyzed in terms of intuitionistic linear type theory. This is compatible with a general recursion…”
Get full text

Strong normalization for second order classical natural deduction by Parigot, M.

“…The strong normalization theorem for second-order classical natural deduction is proved. The method used is an adaptation of the one of reducibility candidates…”
Get full text

Asymptotic probabilities of languages with generalized quantifiers by Fayolle, G., Grumbach, S., Tollu, C.

“…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…”
Get full text

Local and asynchronous beta-reduction (an analysis of Girard's execution formula) by Danos, V., Regnier, L.

“…The authors build a confluent, local, asynchronous reduction on lambda -terms, using infinite objects (partial injections of Girard's (1988) algebra L*), which…”
Get full text

Relational properties of recursively defined domains by Pitts, A.M.

“…A mixed induction/coinduction property of relations on recursively defined domains is described, working within a general framework for relations on domains…”
Get full text

Verifying programs with unreliable channels by Abdulla, P., Jonsson, B.

“…The verification of a particular class of infinite-state systems, namely, systems consisting of finite-state processes that communicate via unbounded lossy…”
Get full text

The order types of termination orderings on monadic terms, strings and multisets by Martin, U., Scott, E.

“…Total well-founded orderings on monadic terms satisfying the replacement and full invariance properties are considered. It is shown that any such ordering on…”
Get full text

The unifiability problem in ground AC theories by Narendran, P., Rusinowitch, M.

“…It is shown that unifiability is decidable in theories presented by a set of ground equations with several associative-communicative symbols (ground AC…”
Get full text

Self-synchronization of concurrent processes by Jategaonkar, L., Meyer, A.R.

“…Introduces a unary "self-synchronization" operation on concurrent processes that synchronizes concurrent transitions within a process. Standard parallel…”
Get full text

Automated production of traditional proofs for constructive geometry theorems by Chou, S.-C., Gao, X.-S., Zhang, J.-Z.

“…The authors present a method that can produce traditional proofs for a class of geometry statements whose hypotheses can be described constructively and whose…”
Get full text

Database query languages embedded in the typed lambda calculus by Hillebrand, G.G., Kanellakis, P.C., Mairson, H.G.

“…It is shown how to naturally embed, in the typed lambda -calculus with equality, many database query languages, including the relational calculus/algebra,…”
Get full text

Encoding the calculus of constructions in a higher-order logic by Felty, A.

“…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…”
Get full text

Infinitary logics and very sparse random graphs by Lynch, J.F.

“…The infinitary language obtained from the first-order language of graphs by closure under conjunctions and disjunctions of arbitrary sets of formulas, provided…”
Get full text

A lambda calculus of objects and method specialization by Mitchell, J.C., Honsell, F., Fisher, K.

“…An untyped lambda calculus, extended with object primitives that reflect the capabilities of so-called delegation-based object-oriented languages, is…”
Get full text

Standard ML-NJ weak polymorphism and imperative constructs by Hoang, M., Mitchell, J., Viswanathan, R.

“…Standard ML of New Jersey (SML-NJ) uses weak-type variables to restrict the polymorphic use of functions that may allocate reference cells, manipulate…”
Get full text