06163nam 22007095 450 99646577520331620200705124647.03-540-48211-310.1007/3-540-57529-4(CKB)1000000000234062(SSID)ssj0000323285(PQKBManifestationID)11242984(PQKBTitleCode)TC0000323285(PQKBWorkID)10297145(PQKB)11283229(DE-He213)978-3-540-48211-6(PPN)155175718(EXLCZ)99100000000023406220121227d1993 u| 0engurnn|008mamaatxtccrFoundations of Software Technology and Theoretical Computer Science[electronic resource] 13th Conference, Bombay, India, December 15-17, 1993. Proceedings /edited by Rudrapatna K. Shyamasundar1st ed. 1993.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,1993.1 online resource (CDLXXVI, 462 p.) Lecture Notes in Computer Science,0302-9743 ;761Bibliographic Level Mode of Issuance: Monograph3-540-57529-4 Some observations about the nature of computer science -- Essential intersection type assignment -- Label-selective ?-calculus syntax and confluence -- Conventional and uniqueness typing in graph rewrite systems -- A meta-language for typed object-oriented languages -- Preemption in concurrent systems -- Local versus non-local computation of length of digitized curves -- Data-independences of parallel random access machines -- Proving termination of logic programs by transforming them into equivalent term rewriting systems -- Completeness of hierarchical combinations of term rewriting systems -- Higher-order and semantic unification -- A conservative extension of first-order logic and its applications to theorem proving -- Well-founded Ordered Search (extended abstract) -- A real-time interval logic and its decision procedure -- On the semantics of optimization predicates in CLP languages -- Incremental algorithms for constraint solving and entailment over rational trees -- Proximity problems and the Voronoi diagram on a rectilinear plane with rectangular obstacles -- Feasibility of design in stereolithography -- Compact location problems -- On some communication complexity problems related to threshold functions -- Recursiveness over the complex numbers is time-bounded -- A lower bound for solvability of polynomial equations -- Reuse of proofs in software verification -- Induce-statements and induce-expressions: Constructs for inductive programming -- A graphic language based on timing diagrams -- Software technology: Integrating theory and practice -- Generating degrees of belief from statistical information: An overview -- Complexity results for 1-safe nets -- Some results about logical descriptions of non deterministic behaviours -- Order structures and generalisations of Szpilrajn's theorem -- ICSP and its relationship with ACSP and CSP -- On reduction-based process semantics -- Keeping track of the latest gossip: Bounded time-stamps suffice -- Time optimal self-stabilizing spanning tree algorithms -- Efficient algorithm to sort linear combinations of arrays -- A simple file structure for the weighted dictionary problem -- Searching, sorting and randomised algorithms for Central Elements and ideal counting in posets -- Learning classes of Regular and Linear Languages in Valiant's learnability framework.For more than a decade, Foundations of Software Technology and Theoretical Computer Science Conferences have been providing an annual forum for the presentation of new research results in India and abroad. This year, 119 papers from 20 countries were submitted. Each paper was reviewed by at least three reviewers, and 33 papers were selected for presentation and included in this volume, grouped into parts on type theory, parallel algorithms, term rewriting, logic and constraint logic programming, computational geometry and complexity, software technology, concurrency, distributed algorithms, and algorithms and learning theory. Also included in the volume are the five invited papers presented at theconference.Lecture Notes in Computer Science,0302-9743 ;761ComputersSoftware engineeringComputer logicProgramming languages (Electronic computers)Mathematical logicTheory of Computationhttps://scigraph.springernature.com/ontologies/product-market-codes/I16005Software Engineering/Programming and Operating Systemshttps://scigraph.springernature.com/ontologies/product-market-codes/I14002Logics and Meanings of Programshttps://scigraph.springernature.com/ontologies/product-market-codes/I1603XComputation by Abstract Deviceshttps://scigraph.springernature.com/ontologies/product-market-codes/I16013Programming Languages, Compilers, Interpretershttps://scigraph.springernature.com/ontologies/product-market-codes/I14037Mathematical Logic and Formal Languageshttps://scigraph.springernature.com/ontologies/product-market-codes/I16048Computers.Software engineering.Computer logic.Programming languages (Electronic computers).Mathematical logic.Theory of Computation.Software Engineering/Programming and Operating Systems.Logics and Meanings of Programs.Computation by Abstract Devices.Programming Languages, Compilers, Interpreters.Mathematical Logic and Formal Languages.004.0151Shyamasundar Rudrapatna Kedthttp://id.loc.gov/vocabulary/relators/edtBOOK996465775203316Foundations of software technology and theoretical computer science383921UNISA