05040nam 22007575 450 99646586110331620200704222152.03-540-70722-010.1007/3-540-61780-9(CKB)1000000000234541(SSID)ssj0000327464(PQKBManifestationID)11247115(PQKBTitleCode)TC0000327464(PQKBWorkID)10299452(PQKB)10754986(DE-He213)978-3-540-70722-6(PPN)155190849(EXLCZ)99100000000023454120121227d1996 u| 0engurnn|008mamaatxtccrTypes for Proofs and Programs[electronic resource] International Workshop, TYPES '95, Torino, Italy, June 5 - 8, 1995 Selected Papers /edited by Stefano Berardi, Mario Coppo1st ed. 1996.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,1996.1 online resource (X, 298 p.) Lecture Notes in Computer Science,0302-9743 ;1158Bibliographic Level Mode of Issuance: Monograph3-540-61780-9 Implicit coercions in type systems -- A two-level approach towards lean proof-checking -- The greatest common divisor: A case study for program extraction from classical proofs -- Extracting a proof of coherence for monoidal categories from a proof of normalization for monoids -- A constructive proof of the Heine-Borel covering theorem for formal reals -- An application of constructive completeness -- Automating inversion of inductive predicates in Coq -- First order marked types -- Internal type theory -- An application of co-inductive types in Coq: Verification of the alternating bit protocol -- Conservativity of equality reflection over intensional type theory -- A natural deduction approach to dynamic logic -- An algorithm for checking incomplete proof objects in type theory with localization and unification -- Decidability of all minimal models -- Circuits as streams in Coq: Verification of a sequential multiplier -- Context-relative syntactic categories and the formalization of mathematical text -- A simple model construction for the Calculus of Constructions -- Optimized encodings of fragments of type theory in first order logic -- Organization and development of a constructive axiomatization.This volume contains a refereed selection of revised full papers chosen from the contributions presented during the Third Annual Workshop held under the auspices of the ESPRIT Basic Research Action 6453 Types for Proofs and Programs. The workshop took place in Torino, Italy, in June 1995. Type theory is a formalism in which theorems and proofs, specifications and programs can be represented in a uniform way. The 19 papers included in the book deal with foundations of type theory, logical frameworks, and implementations and applications; all in all they constitute a state-of-the-art survey for the area of type theory.Lecture Notes in Computer Science,0302-9743 ;1158Mathematical logicSoftware engineeringComputersComputer logicProgramming languages (Electronic computers)Artificial intelligenceMathematical Logic and Formal Languageshttps://scigraph.springernature.com/ontologies/product-market-codes/I16048Software Engineering/Programming and Operating Systemshttps://scigraph.springernature.com/ontologies/product-market-codes/I14002Theory of Computationhttps://scigraph.springernature.com/ontologies/product-market-codes/I16005Logics and Meanings of Programshttps://scigraph.springernature.com/ontologies/product-market-codes/I1603XProgramming Languages, Compilers, Interpretershttps://scigraph.springernature.com/ontologies/product-market-codes/I14037Artificial Intelligencehttps://scigraph.springernature.com/ontologies/product-market-codes/I21000Mathematical logic.Software engineering.Computers.Computer logic.Programming languages (Electronic computers).Artificial intelligence.Mathematical Logic and Formal Languages.Software Engineering/Programming and Operating Systems.Theory of Computation.Logics and Meanings of Programs.Programming Languages, Compilers, Interpreters.Artificial Intelligence.511.3/0285Berardi Stefanoedthttp://id.loc.gov/vocabulary/relators/edtCoppo Marioedthttp://id.loc.gov/vocabulary/relators/edtTYPES '95BOOK996465861103316Types for Proofs and Programs771867UNISA04515nam 22007335 450 991029966660332120200701111819.01-4471-6606-X10.1007/978-1-4471-6606-1(CKB)3710000000261516(EBL)1965997(OCoLC)894508473(SSID)ssj0001372509(PQKBManifestationID)11881966(PQKBTitleCode)TC0001372509(PQKBWorkID)11305230(PQKB)11265441(DE-He213)978-1-4471-6606-1(MiAaPQ)EBC1965997(PPN)182098907(EXLCZ)99371000000026151620141016d2015 u| 0engur|n|---|||||txtccrS-Variable Approach to LMI-Based Robust Control /by Yoshio Ebihara, Dimitri Peaucelle, Denis Arzelier1st ed. 2015.London :Springer London :Imprint: Springer,2015.1 online resource (260 p.)Communications and Control Engineering,0178-5354Description based upon print version of record.1-4471-6605-1 Includes bibliographical references and index.Introduction -- Robust Performance Analysis of LTI Systems -- Descriptor Case and System Augmentation -- Robust State-Feedback Synthesis for LTI Systems -- Multi-Objective Controller Synthesis for LTI Systems -- Static Output-Feedback Synthesis -- Robust Performance Analysis of Discrete-Time Periodic Systems -- Robust Controller Synthesis of Periodic Discrete-Time Systems.This book shows how the use of S-variables (SVs) in enhancing the range of problems that can be addressed with the already-versatile linear matrix inequality (LMI) approach to control can, in many cases, be put on a more unified, methodical footing. Beginning with the fundamentals of the SV approach, the text shows how the basic idea can be used for each problem (and when it should not be employed at all). The specific adaptations of the method necessitated by each problem are also detailed. The problems dealt with in the book have the common traits that: analytic closed-form solutions are not available; and LMIs can be applied to produce numerical solutions with a certain amount of conservatism. Typical examples are robustness analysis of linear systems affected by parametric uncertainties and the synthesis of a linear controller satisfying multiple, often  conflicting, design specifications. For problems in which LMI methods produce conservative results, the SV approach is shown to achieve greater accuracy. The authors emphasize the simplicity and easy comprehensibility of the SV approach and show how it can be implemented in programs without difficulty so that its power becomes readily apparent. The S-Variable Approach to LMI-Based Robust Control is a useful reference for academic control researchers, applied mathematicians and graduate students interested in LMI methods and convex optimization and will also be of considerable assistance to practising control engineers faced with problems of conservatism in their systems and controllers.Communications and Control Engineering,0178-5354Automatic controlSystem theoryMathematical optimizationControl and Systems Theoryhttps://scigraph.springernature.com/ontologies/product-market-codes/T19010Systems Theory, Controlhttps://scigraph.springernature.com/ontologies/product-market-codes/M13070Optimizationhttps://scigraph.springernature.com/ontologies/product-market-codes/M26008Automatic control.System theory.Mathematical optimization.Control and Systems Theory.Systems Theory, Control.Optimization.519519.6620629.8Ebihara Yoshioauthttp://id.loc.gov/vocabulary/relators/aut720990Peaucelle Dimitriauthttp://id.loc.gov/vocabulary/relators/autArzelier Denisauthttp://id.loc.gov/vocabulary/relators/autMiAaPQMiAaPQMiAaPQBOOK9910299666603321S-Variable Approach to LMI-Based Robust Control2531489UNINA