Info
Automata, Languages and Programming [[electronic resource] ] : 16th International Colloquium, Stresa, Italy, July 11-15, 1989. Proceedings / / edited by Giorgio Ausiello, Mariangiola Dezani-Ciancaglini, Simonetta Ronchi Della Rocca
| Automata, Languages and Programming [[electronic resource] ] : 16th International Colloquium, Stresa, Italy, July 11-15, 1989. Proceedings / / edited by Giorgio Ausiello, Mariangiola Dezani-Ciancaglini, Simonetta Ronchi Della Rocca |
| Edizione | [1st ed. 1989.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1989 |
| Descrizione fisica | 1 online resource (XIV, 790 p.) |
| Disciplina | 004.0151 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Computer logic Algorithms Mathematical logic Combinatorics Theory of Computation Logics and Meanings of Programs Algorithm Analysis and Problem Complexity Mathematical Logic and Formal Languages Computation by Abstract Devices |
| ISBN | 3-540-46201-5 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Realizable and unrealizable specifications of reactive systems -- Limitations of the upward separation technique (preliminary version) -- Lower bounds for the low hierarchy -- Efficient text searching of regular expressions -- Factors of words -- Asymptotically optimal distributed consensus -- Time lower bounds for CREW-PRAM computation of monotone functions -- Subduing self-application -- Everything in NP can be argued in perfect zero-knowledge in a bounded number of rounds -- Polymorphic rewriting conserves algebraic strong normalization and confluence -- Completion of finite codes with finite deciphering delay -- Relational semantics for recursive types and bounded quantification -- A singly-exponential stratification scheme for real semi-algebraic varieties and its applications -- About primitive recursive algorithms -- The definability of equational graphs in monadic second-order logic -- Dominoes and the regularity of DNA splicing languages -- Causal trees -- Infinite normal forms -- On recent trends in algebraic specification -- Automata with storage on infinite words -- Parallel algorithmic techniques for combinatorial computation -- On dice and coins: models of computation for random generation -- An optimal probabilistic algorithm for synchronous Byzantine agreement -- Finding triconnected components by local replacements -- An improved algorithm for approximate string matching -- A pointer-free data structure for merging heaps and min-max heaps -- Structured operational semantics and bisimulation as a congruence -- Parallel retrieval of scattered information -- Tensor rank is NP-complete -- The complexity of nonlinear separable optimization -- General methods for the analysis of the maximum size of dynamic data structures -- How to share concurrent asynchronous wait-free variables -- A new approach to formal language theory by kolmogorov complexity -- Dynamic algorithms in D.E. Knuth's model: A probabilistic analysis -- Completing the temporal picture -- Lower bounds for computations with the floor operation -- Programming, transforming, and proving with function abstractions and memories -- Automata theory meets circuit complexity -- Two versus one index register and modifiable versus non-modifiable programs -- Shortest paths without a map -- Modular system design applying graph grammars techniques -- Partial communations -- On the synthesis of an asynchronous reactive module -- The complexity of controlled selection -- Memory versus randomization in on-line algorithms -- Syntactic control of interference Part 2 -- Characteristic formulae -- A combinatorial technique for separating counting complexity classes -- Horn programs and semicomputable relations on abstract structures -- A note on model checking the modal v-calculus -- DI-domains as information systems. |
| Record Nr. | UNISA-996465720703316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1989 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Typed Lambda Calculi and Applications [[electronic resource] ] : Second International Conference on Typed Lambda Calculi and Applications, TLCA '95, Edinburgh, United Kingdom, April 10 - 12, 1995. Proceedings / / edited by Mariangiola Dezani-Ciancaglini, Gordon Plotkin
| Typed Lambda Calculi and Applications [[electronic resource] ] : Second International Conference on Typed Lambda Calculi and Applications, TLCA '95, Edinburgh, United Kingdom, April 10 - 12, 1995. Proceedings / / edited by Mariangiola Dezani-Ciancaglini, Gordon Plotkin |
| Edizione | [1st ed. 1995.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1995 |
| Descrizione fisica | 1 online resource (VIII, 452 p.) |
| Disciplina | 511.3 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Mathematical logic Computer logic Computer programming Theory of Computation Mathematical Logic and Foundations Mathematical Logic and Formal Languages Logics and Meanings of Programs Programming Techniques |
| ISBN | 3-540-49178-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Comparing ?-calculus translations in sharing graphs -- Extensions of pure type systems -- A model for formal parametric polymorphism: A per interpretation for system R -- A realization of the negative interpretation of the Axiom of Choice -- Using subtyping in program optimization -- What is a categorical model of Intuitionistic Linear Logic? -- An explicit Eta rewrite rule -- Extracting text from proofs -- Higher-order abstract syntax in Coq -- Expanding extensional polymorphism -- Lambda-calculus, combinators and the comprehension scheme -- ??-Equality for coproducts -- Typed operational semantics -- A simple calculus of exception handling -- A simple model for quotient types -- Untyped ?-calculus with relative typing -- Final semantics for untyped ?-calculus -- A simplification of Girard's paradox -- Basic properties of data types with inequational refinements -- Decidable properties of intersection type systems -- Termination proof of term rewriting system with the multiset path ordering. A complete development in the system Coq -- Typed ?-calculi with explicit substitutions may not terminate -- On equivalence classes of interpolation equations -- Strict functionals for termination proofs -- A verified typechecker -- Categorical semantics of the call-by-value ?-calculus -- A fully abstract translation between a ?-calculus with reference types and Standard ML -- Categorical completeness results for the simply-typed lambda-calculus -- Third-order matching in the presence of type constructors. |
| Record Nr. | UNISA-996466100403316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1995 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||