03902nam 22004935 450 99646565130331620200706084633.03-540-45970-710.1007/3-540-50325-0(CKB)1000000000233321(SSID)ssj0000326169(PQKBManifestationID)11230937(PQKBTitleCode)TC0000326169(PQKBWorkID)10264982(PQKB)11299346(DE-He213)978-3-540-45970-5(PPN)155165488(EXLCZ)99100000000023332120121227d1988 u| 0engurnn#008mamaatxtccrRecent Trends in Data Type Specification[electronic resource] Fifth Workshop on Specification of Abstract Data Types. Gullane, Scotland, September 1-4, 1987. Selected Papers /edited by Donald Sannella1st ed. 1988.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,1988.1 online resource (VIII, 268 p.)Lecture Notes in Computer Science,0302-9743 ;332Bibliographic Level Mode of Issuance: Monograph3-540-50325-0 The stratified loose approach: A generalization of initial and loose semantics -- Algebraic data type and process specifications based on projection spaces -- Structuring theories on consequence -- Completion with history-dependent complexities for generated equations -- Jungle evaluation -- The ACT-system experiences and future enhancements -- The specification language of OBSCURE -- Algebraic specifications of reachable higher-order algebras -- Observing nondeterministic data types -- Initial behaviour semantics for algebraic specifications -- Partial algebras, subsorting, and dependent types -- Operational semantics of behavioural canons based on narrowing -- The algebraic specification of semicomputable data types.The Fifth Workshop on Specification of Abstract Data Types took place 1-4 September 1987 in Gullane, near Edinburgh. This book contains papers based on selected talks presented at the workshop. The algebraic specification of abstract data types has been a flourishing topic in computer science since 1974. The main goal of work in this area is to evolve a methodology to support the design and formal development of reliable software. The particular approach taken builds upon concepts from universal algebra and elementary category theory. The core of this work has now stabilized to a great extent and is mature enough to find application in real-life software engineering and to related topics such as concurrency, databases, and even hardware design. Such applications are becoming more feasible because of the emergence of integrated specification/development environments which include tools such as theorem provers based on fast term rewriting engines. Researchers are also exploring ways of widening the scope of the theory to make it applicable to (for example) higher-order functions and non-deterministic programs. Another trend is toward taking a more general view which allows superficially different approaches having the same general aims and methods to be unified.Lecture Notes in Computer Science,0302-9743 ;332Programming languages (Electronic computers)Programming Languages, Compilers, Interpretershttps://scigraph.springernature.com/ontologies/product-market-codes/I14037Programming languages (Electronic computers).Programming Languages, Compilers, Interpreters.005.13Sannella Donaldedthttp://id.loc.gov/vocabulary/relators/edtBOOK996465651303316Recent Trends in Data Type Specification2829876UNISA03629nam 22006615 450 99646438610331620230329212423.03-030-90048-710.1007/978-3-030-90048-9(CKB)5470000001298843(MiAaPQ)EBC6795891(Au-PeEL)EBL6795891(OCoLC)1281769516(DE-He213)978-3-030-90048-9(PPN)258296518(EXLCZ)99547000000129884320211028d2021 u| 0engurcnu||||||||txtrdacontentcrdamediacrrdacarrierDiscrete and Computational Geometry, Graphs, and Games[electronic resource] 21st Japanese Conference, JCDCGGG 2018, Quezon City, Philippines, September 1-3, 2018, Revised Selected Papers /edited by Jin Akiyama, Reginaldo M. Marcelo, Mari-Jo P. Ruiz, Yushi Uno1st ed. 2021.Cham :Springer International Publishing :Imprint: Springer,2021.1 online resource (196 pages)Theoretical Computer Science and General Issues,2512-2029 ;130343-030-90047-9 On Geometric Graphs on Point Sets in the Plane -- The Two-distance Sets in Dimension Four -- Negative Instance for the Edge Patrolling Beacon Problem -- Global Location-Domination in the Join and Cartesian Product of Graphs -- The Metric Dimension of the Join of Paths and Cycles -- Barnette’s Conjecture Through the Lens of the ModkP Complexity Classes -- Amiltonicity of graphs on surfaces in terms of toughness and scattering number – A survey -- On Structural Parameterizations of Node Kayles -- Robustness in power-law kinetic systems with reactant-determined interactions -- Toward Unfolding Doubly Covered n-Stars -- Crystallographic Flat Origami from n-Uniform Tilings -- Packing Cube Nets into Rectangles with O(1) Holes -- On the Complexity of Jelly-no-Puzzle -- Computational Complexity of Two Pencil Puzzles.This book constitutes the thoroughly refereed post-conference proceedings of the 21st Japanese Conference on Discrete and Computational Geometry and Graphs, JCDCGGG 2018, held in Quezon City, Philippines, in September 2018. The total of 14 papers included in this volume was carefully reviewed and selected from 25 submissions. The papers feature advances made in the field of computational geometry and focus on emerging technologies, new methodology and applications, graph theory and dynamics.Theoretical Computer Science and General Issues,2512-2029 ;13034Computer graphicsComputer scienceComputer science—MathematicsData structures (Computer science)Information theoryComputer GraphicsTheory of ComputationMathematics of ComputingData Structures and Information TheoryComputer graphics.Computer science.Computer science—Mathematics.Data structures (Computer science).Information theory.Computer Graphics.Theory of Computation.Mathematics of Computing.Data Structures and Information Theory.516.11Akiyama J.MiAaPQMiAaPQMiAaPQBOOK996464386103316Discrete and computational geometry, graphs, and games2901137UNISA