00933nam0 2200265 450 00001787620081030172435.0052108156420081021d1971----km-y0itay50------baengGBy-------001yySoviet planning todayproposals for an optimally functioning economic systemby Michael EllmanCambridgeCambridge university press1971XV, 219 p.24 cmOccasional papersUniversity of Cambridge, Department of applied economics252001Occasional papersSoviet planning today34847330.94719Situazioni e condizioni economiche. Unione SovieticaEllman,Michael126249ITUNIPARTHENOPE20081021RICAUNIMARC000017876052/344044NAVA2Soviet planning today34847UNIPARTHENOPE06028nam 22007455 450 99646566520331620200705171733.03-540-68596-010.1007/3-540-61464-8(CKB)1000000000234483(SSID)ssj0000326349(PQKBManifestationID)11266251(PQKBTitleCode)TC0000326349(PQKBWorkID)10267436(PQKB)10256506(DE-He213)978-3-540-68596-8(PPN)155233459(EXLCZ)99100000000023448320121227d1996 u| 0engurnn|008mamaatxtccrRewriting Techniques and Applications[electronic resource] 7th International Conference, RTA-96, New Brunswick, NJ, USA July 27 - 30, 1996. Proceedings /edited by Harald Ganzinger1st ed. 1996.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,1996.1 online resource (XI, 440 p.) Lecture Notes in Computer Science,0302-9743 ;1103Bibliographic Level Mode of Issuance: Monograph3-540-61464-8 Rewrite-based automated reasoning: Challenges ahead -- Fine-grained concurrent completion -- AC-complete unification and its application to theorem proving -- Superposition theorem proving for abelian groups represented as integer modules -- Symideal Gröbner bases -- Termination of constructor systems -- Dummy elimination in equational rewriting -- On proving termination by innermost termination -- A recursive path ordering for higher-order terms in ?-long ?-normal form -- Higher-order superposition for dependent types -- Higher-order narrowing with definitional trees -- Design of a proof assistant -- A compiler for nondeterministic term rewriting systems -- Combinatory reduction systems with explicit substitution that preserve strong normalisation -- Confluence properties of extensional and non-extensional ?-calculi with explicit substitutions (extended abstract) -- On the power of simple diagrams -- Coherence for sharing proof nets -- Modularity of termination in term graph rewriting -- Confluence of terminating conditional rewrite systems revisited -- Applications of rewrite techniques in monoids and rings -- Compositional term rewriting: An algebraic proof of Toyama's theorem -- The first-order theory of one-step rewriting is undecidable -- An algorithm for distributive unification -- On the termination problem for one-rule semi-Thue system -- Efficient second-order matching -- Linear second-order unification -- Unification of higher-order patterns in a simply typed lambda-calculus with finite products and terminal type -- Decidable approximations of term rewriting systems -- Semantics and strong sequentially of priority term rewriting systems -- Higher-order families -- A new proof manager and graphic interface for the larch prover -- ReDuX 1.5: New facets of rewriting -- CiME: Completion modulo E -- Distributed larch prover (DLP): An experiment in parallelizing a rewrite-rule based prover -- EPIC: An equational language Abstract machine and supporting tools -- SPIKE-AC: A system for proofs by induction in Associative-Commutative theories -- On gaining efficiency in completion-based theorem proving.This book constitutes the refereed proceedings of the 7th International Conference on Rewriting Techniques and Applications, RTA-96, held in New Brunswick, NJ, USA, in July 1996. The 27 revised full papers presented in this volume were selected from a total of 84 submissions, also included are six system descriptions and abstracts of three invited papers. The topics covered include analysis of term rewriting systems, string and graph rewriting, rewrite-based theorem proving, conditional term rewriting, higher-order rewriting, unification, symbolic and algebraic computation, and efficient implementation of rewriting on sequential and parallel machines.Lecture Notes in Computer Science,0302-9743 ;1103Software engineeringComputersProgramming languages (Electronic computers)Computer logicMathematical logicArtificial intelligenceSoftware Engineering/Programming and Operating Systemshttps://scigraph.springernature.com/ontologies/product-market-codes/I14002Theory of Computationhttps://scigraph.springernature.com/ontologies/product-market-codes/I16005Programming Languages, Compilers, Interpretershttps://scigraph.springernature.com/ontologies/product-market-codes/I14037Logics and Meanings of Programshttps://scigraph.springernature.com/ontologies/product-market-codes/I1603XMathematical Logic and Formal Languageshttps://scigraph.springernature.com/ontologies/product-market-codes/I16048Artificial Intelligencehttps://scigraph.springernature.com/ontologies/product-market-codes/I21000Software engineering.Computers.Programming languages (Electronic computers).Computer logic.Mathematical logic.Artificial intelligence.Software Engineering/Programming and Operating Systems.Theory of Computation.Programming Languages, Compilers, Interpreters.Logics and Meanings of Programs.Mathematical Logic and Formal Languages.Artificial Intelligence.005.13/1Ganzinger Haraldedthttp://id.loc.gov/vocabulary/relators/edtInternational Conference on Rewriting Techniques and Applications(7th :1996 :New Brunswick, N.J.)BOOK996465665203316Rewriting Techniques and Applications774195UNISA