Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Computer Science Logic [[electronic resource] ] : 8th Workshop, CSL '94, Kazimierz, Poland, September 25 - 30, 1994. Selected Papers / / edited by Leszek Pacholski, Jerzy Tiuryn
| Computer Science Logic [[electronic resource] ] : 8th Workshop, CSL '94, Kazimierz, Poland, September 25 - 30, 1994. Selected Papers / / edited by Leszek Pacholski, Jerzy Tiuryn |
| Edizione | [1st ed. 1995.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1995 |
| Descrizione fisica | 1 online resource (XI, 553 p.) |
| Disciplina | 004/.01/5113 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Programming languages (Electronic computers) Mathematical logic Computer logic Artificial intelligence Theory of Computation Programming Languages, Compilers, Interpreters Mathematical Logic and Foundations Mathematical Logic and Formal Languages Logics and Meanings of Programs Artificial Intelligence |
| ISBN | 3-540-49404-9 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Subtyping with singleton types -- A subtyping for the Fisher-Honsell-Mitchell lambda calculus of objects -- The Girard Translation extended with recursion -- Decidability of higher-order subtyping with intersection types -- A ?-calculus structure isomorphic to Gentzen-style sequent calculus structure -- Usability: formalising (un)definedness in typed lambda calculus -- Lambda representation of operations between different term algebras -- Semi-unification and generalizations of a particularly simple form -- A mixed linear and non-linear logic: Proofs, terms and models -- Cut free formalization of logic with finitely many variables. Part I. -- How to lie without being (easily) convicted and the lengths of proofs in propositional calculus -- Monadic second-order logic and linear orderings of finite structures -- First-order spectra with one binary predicate -- Monadic logical definability of NP-complete problems -- Logics for context-free languages -- Log-approximable minimization problems on random inputs -- Convergence and 0–1 laws for L ?,? k under arbitrary measures -- Is first order contained in an initial segment of PTIME? -- Logic programming in Tau Categories -- Reasoning and rewriting with set-relations I: Ground completeness -- Resolution games and non-liftable resolution orderings -- On existential theories of list concatenation -- Completeness of resolution for definite answers with case analysis -- Subrecursion as a basis for a feasible programming language -- A sound metalogical semantics for input/output effects -- An intuitionistic modal logic with applications to the formal verification of hardware -- Towards machine-checked compiler correctness for higher-order pure functional languages -- Powerdomains, powerstructures and fairness -- Canonical forms for data-specifications -- An algebraic view of structural induction -- On the interpretation of type theory in locally cartesian closed categories -- Algorithmic aspects of propositional tense logics -- Stratified default theories -- A homomorphism concept for ?-regularity -- Ramified recurrence and computational complexity II: Substitution and poly-space -- General form recursive equations I -- Modal logics preserving admissible for S4 inference rules -- A bounded set theory with Anti-Foundation Axiom and inductive definability. |
| Record Nr. | UNISA-996466138903316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1995 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Foundation of Software Science and Computation Structures [[electronic resource] ] : Third International Conference, FOSSACS 2000 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2000 Berlin, Germany, March 25 - April 2, 2000 Proceedings / / edited by Jerzy Tiuryn
| Foundation of Software Science and Computation Structures [[electronic resource] ] : Third International Conference, FOSSACS 2000 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2000 Berlin, Germany, March 25 - April 2, 2000 Proceedings / / edited by Jerzy Tiuryn |
| Edizione | [1st ed. 2000.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 |
| Descrizione fisica | 1 online resource (X, 398 p.) |
| Disciplina | 005.1 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Programming languages (Electronic computers)
Computer logic Mathematical logic Software engineering Programming Languages, Compilers, Interpreters Logics and Meanings of Programs Mathematical Logic and Formal Languages Software Engineering |
| ISBN | 3-540-46432-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Norm Functions for Probabilistic Bisimulations with Delays -- Constructor Subtyping in the Calculus of Inductive Constructions -- Verifying Performance Equivalence for Timed Basic Parallel Processes -- On Word Rewriting Systems Having a Rational Derivation -- Proof Nets and Explicit Substitutions -- Typing Local Definitions and Conditional Expressions with Rank 2 Intersection (Extended Abstract) -- Hierarchical Graph Transformation -- A Program Refinement Framework Supporting Reasoning about Knowledge and Time -- A Higher-Order Simulation Relation for System F -- Probabilistic Asynchronous ?-Calculus -- Constructive Data Refinement in Typed Lambda Calculus -- On Recognizable Stable Trace Languages -- The State Explosion Problem from Trace to Bisimulation Equivalence -- A Proof System for Timed Automata -- Categorical Models for Intuitionistic and Linear Type Theory -- Locality and Polyadicity in Asynchronous Name-Passing Calculi -- On Rational Graphs -- Sequential and Concurrent Abstract Machines for Interaction Nets -- On Synchronous and Asynchronous Mobile Processes -- Type Inference for First-Order Logic -- An Algebraic Foundation for Adaptive Programming -- Predicate Logic and Tree Automata with Tests -- Compositional Verification in Linear-Time Temporal Logic -- On the Semantics of Refinement Calculi -- Subtyping and Typing Algorithms for Mobile Ambients. |
| Record Nr. | UNISA-996465608403316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Foundation of Software Science and Computation Structures : Third International Conference, FOSSACS 2000 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2000 Berlin, Germany, March 25 - April 2, 2000 Proceedings / / edited by Jerzy Tiuryn
| Foundation of Software Science and Computation Structures : Third International Conference, FOSSACS 2000 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2000 Berlin, Germany, March 25 - April 2, 2000 Proceedings / / edited by Jerzy Tiuryn |
| Edizione | [1st ed. 2000.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 |
| Descrizione fisica | 1 online resource (X, 398 p.) |
| Disciplina | 005.1 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Programming languages (Electronic computers)
Computer logic Mathematical logic Software engineering Programming Languages, Compilers, Interpreters Logics and Meanings of Programs Mathematical Logic and Formal Languages Software Engineering |
| ISBN | 3-540-46432-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Norm Functions for Probabilistic Bisimulations with Delays -- Constructor Subtyping in the Calculus of Inductive Constructions -- Verifying Performance Equivalence for Timed Basic Parallel Processes -- On Word Rewriting Systems Having a Rational Derivation -- Proof Nets and Explicit Substitutions -- Typing Local Definitions and Conditional Expressions with Rank 2 Intersection (Extended Abstract) -- Hierarchical Graph Transformation -- A Program Refinement Framework Supporting Reasoning about Knowledge and Time -- A Higher-Order Simulation Relation for System F -- Probabilistic Asynchronous ?-Calculus -- Constructive Data Refinement in Typed Lambda Calculus -- On Recognizable Stable Trace Languages -- The State Explosion Problem from Trace to Bisimulation Equivalence -- A Proof System for Timed Automata -- Categorical Models for Intuitionistic and Linear Type Theory -- Locality and Polyadicity in Asynchronous Name-Passing Calculi -- On Rational Graphs -- Sequential and Concurrent Abstract Machines for Interaction Nets -- On Synchronous and Asynchronous Mobile Processes -- Type Inference for First-Order Logic -- An Algebraic Foundation for Adaptive Programming -- Predicate Logic and Tree Automata with Tests -- Compositional Verification in Linear-Time Temporal Logic -- On the Semantics of Refinement Calculi -- Subtyping and Typing Algorithms for Mobile Ambients. |
| Record Nr. | UNINA-9910143635503321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||