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.
Mathematical Foundation of Programming Semantics [[electronic resource] ] : International Conference, Manhattan, Kansas, April 11-12, 1985. Proceedings / / edited by Austin Melton
| Mathematical Foundation of Programming Semantics [[electronic resource] ] : International Conference, Manhattan, Kansas, April 11-12, 1985. Proceedings / / edited by Austin Melton |
| Edizione | [1st ed. 1986.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1986 |
| Descrizione fisica | 1 online resource (VIII, 400 p.) |
| Disciplina | 005.1015113 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer logic
Logics and Meanings of Programs |
| ISBN | 3-540-44861-6 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Standard, storeless semantics for ALGOL-style block structure and call-by-name -- Cartesian closed categories, quasitopoi and topological universes -- Concrete categories and injectivity -- Fixed points in process algebras with internal actions -- A fully abstract semantics and a proof system for an algol-like language with sharing -- Comparing categories of domains -- Galois connections -- Retracts of SFP objects -- Continuous categories -- Free constructions of powerdomains -- Additive domains -- A topological framework for cpos lacking bottom elements -- Detecting local finite breadth in continuous lattices and semilattices -- On the variety concept for ?-continuous algebras. Application of a general approach -- On denotational semantics of data bases -- Postconditional semantics of data base queries -- What is a model? A consumer's perspective on semantic theory -- Modal theory, partial orders, and digital geometry -- An FP domain with infinite objects -- Union complete countable subset systems -- On the syntax and semantics of concurrent computing. |
| Record Nr. | UNISA-996465948803316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1986 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Mathematical Foundations of Programming Language Semantics [[electronic resource] ] : 3rd Workshop Tulane University, New Orleans, Louisiana, USA, April 8–10, 1987 Proceedings / / edited by Michael Main, Austin Melton, Michael Mislove, David Schmidt
| Mathematical Foundations of Programming Language Semantics [[electronic resource] ] : 3rd Workshop Tulane University, New Orleans, Louisiana, USA, April 8–10, 1987 Proceedings / / edited by Michael Main, Austin Melton, Michael Mislove, David Schmidt |
| Edizione | [1st ed. 1988.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1988 |
| Descrizione fisica | 1 online resource (VIII, 640 p. 1 illus.) |
| Disciplina | 510 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Mathematics
Software engineering Computer logic Mathematics, general Software Engineering/Programming and Operating Systems Logics and Meanings of Programs |
| ISBN | 3-540-38920-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | A categorical treatment of polymorphic operations -- A categorical approach to realizability and polymorphic types -- Rule-based semantics for an extended lambda-calculus -- Semantics of block structured languages with pointers -- Assertional categories -- Kan extensions in effective semantics -- The versatile continuous order -- On the Smyth power domain -- The metric closure powerspace construction -- A powerdomain construction -- Closure properties of a probabilistic domain construction -- Quasi-uniformities: Reconciling domains with metric spaces -- Solving reflexive domain equations in a category of complete metric spaces -- Topological completeness in an ideal model for polymorphic types -- New results on hierarchies of domains -- Semantically based axiomatics -- Metric spaces as models for real-time concurrency -- dI-domains as a model of polymorphism -- Continuous auxiliary relations -- Computable one-to-one enumerations of effective domains -- Extended abstract of MIX: A self-applicable partial evaluator for experiments in compiler generation -- Semantics-based tools for a specification-support environment -- A treatment of languages with stages of evaluation -- Operational semantics and a distributed implementation of CSP -- The semantics of Miranda's algebraic types -- Path semantics -- The formal description of data types using sketches -- Initial algebra semantics and concurrency -- High-level semantics -- An action semantics of standard ML -- An algorithmic approach to p-adic integers -- The shuffle bialgebra. |
| Record Nr. | UNISA-996465804903316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1988 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Mathematical Foundations of Programming Semantics [[electronic resource] ] : 9th International Conference, New Orleans, LA, USA, April 7 - 10, 1993. Proceedings / / edited by Stephen Brookes, Michael Main, Austin Melton, Michael Mislove, David Schmidt
| Mathematical Foundations of Programming Semantics [[electronic resource] ] : 9th International Conference, New Orleans, LA, USA, April 7 - 10, 1993. Proceedings / / edited by Stephen Brookes, Michael Main, Austin Melton, Michael Mislove, David Schmidt |
| Edizione | [1st ed. 1994.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1994 |
| Descrizione fisica | 1 online resource (X, 654 p.) |
| Disciplina | 004.0151 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Programming languages (Electronic computers) Computer logic Mathematical logic Theory of Computation Programming Languages, Compilers, Interpreters Computation by Abstract Devices Logics and Meanings of Programs Mathematical Logic and Formal Languages Mathematical Logic and Foundations |
| ISBN | 3-540-48419-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Final universes of processes -- On the symmetry of sequentiality -- Computational adequacy via ‘mixed’ inductive definitions -- A structural co-induction theorem -- Three metric domains of processes for bisimulation -- Topological models for higher order control flow -- An investigation into functions as processes -- Time abstracted bisimulation: Implicit specifications and decidability -- Timewise refinement for communicating processes -- Axiomatising real-timed processes -- A predicative semantics for the refinement of real-time systems -- Compositional process semantics of Petri Boxes -- On the specification of elementary reactive behaviour -- A chemical abstract machine for graph reduction extended abstract -- Lifting theorems for Kleisli categories -- Sequential functions on indexed domains and full abstraction for a sub-language of PCF -- Another approach to sequentiality: Kleene's unimonotone functions -- Mechanizing logical relations -- Some quasi-varieties of iteration theories -- Probabilistic power domains, information systems, and locales -- Linear domains and linear maps -- Universal quasi-prime algebraic domains -- Holomorphic models of exponential types in linear logic -- A syntax for linear logic -- A complete axiomatisation for trace congruence of finite state behaviors -- The asymmetric topology of computer science -- Ultimately periodic words of rational ?-languages -- Category of ?-functors -- A categorical interpretation of Landin's correspondence principle -- An operational semantics for TOOPLE: A statically-typed object-oriented programming language -- On the transformation between direct and continuation semantics. |
| Record Nr. | UNISA-996466250403316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1994 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Mathematical Foundations of Programming Semantics [[electronic resource] ] : 7th International Conference, Pittsburgh, PA, USA, March 25-28, 1991. Proceedings / / edited by Stephen Brookes, Michael Main, Austin Melton, Michael Mislove, David Schmidt
| Mathematical Foundations of Programming Semantics [[electronic resource] ] : 7th International Conference, Pittsburgh, PA, USA, March 25-28, 1991. Proceedings / / edited by Stephen Brookes, Michael Main, Austin Melton, Michael Mislove, David Schmidt |
| Edizione | [1st ed. 1992.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1992 |
| Descrizione fisica | 1 online resource (VIII, 508 p.) |
| Disciplina | 005.13/1 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer science—Mathematics
Programming languages (Electronic computers) Computers Computer logic Mathematical logic Mathematics of Computing Programming Languages, Compilers, Interpreters Computation by Abstract Devices Logics and Meanings of Programs Mathematical Logic and Formal Languages Mathematical Logic and Foundations |
| ISBN | 3-540-47194-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Types, abstraction, and parametric polymorphism, part 2 -- Call-by-value combinatory logic and the lambda-value calculus -- From operational to denotational semantics -- A simple language supporting angelic nondeterminism and parallel composition -- The equivalence of two semantic definitions for inheritance in object-oriented languages -- Primitive recursive functional with dependent types -- Typed homomorphic relations extended with subtypes -- Information links in domain theory -- Nonwellfounded sets and programming language semantics -- Simultaneous substitution in the typed lambda calculus -- HSP type theorems in the category of posets -- Decomposition of domains -- Cartesian closed categories of domains and the space proj(D) -- An upper power domain construction in terms of strongly compact sets -- Correctness of procedure representations in higher-order assembly language -- An algorithm for analyzing communicating processes -- Continuous functions and parallel algorithms on concrete data structures -- Trade-offs in true concurrency: Pomsets and mazurkiewicz traces -- On relating concurrency and nondeterminism -- On continuous time agents -- A monoidal closed category of event structures -- An exper model for Quest -- Equations for if-then-else -- Program correctness and matricial iteration theories -- Liminf progress measures -- Connections. |
| Record Nr. | UNISA-996465736003316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1992 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||