Theoretical Aspects of Computer Software
Springer Berlin (Verlag)
978-3-540-54415-9 (ISBN)
A semantics for type checking.- Type inference in polymorphic type discipline.- Monotone recursive definition of predicates and its realizability interpretation.- Adding proof objects and inductive definition mechanisms to frege structures.- From term models to domains.- An abstract interpretation for ML equality kinds.- Full abstraction and the Context Lemma (preliminary report).- An efficiency preorder for processes.- On nets, algebras and modularity.- Towards a complete hierarchy of compositional dataflow models.- Type theory as a foundation for computer science.- What is in a step: On the semantics of statecharts.- Proving termination of general Prolog programs.- On abstraction and the expressive power of programming languages.- Role of logic programming in the FGCS project.- Authentication and delegation with smart-cards.- Data flow analysis as model checking.- On the adequacy of dependence-based representations for programs with heaps.- From programming-by-example to proving-by-example.- From LP to LP: Programming with constraints.- Polynomial recursion analysis in pascal like programs.- Complexity of proving program correctness.- Some normalization properties of martin-löf's type theory, and applications.- Parametricity of extensionally collapsed term models of polymorphism and their categorical properties.- Programs with continuations and linear logic.- ?-Calculus semantics of object-oriented programming languages.- Wrapper semantics of an object-oriented programming language with state.- Sharing actions and attributes in modal action logic.- First order data types and first order logic.- Efficient program synthesis: Semantics, logic, complexity.- Principal type-schemes of BCI-lambda-terms.- Intersection and union types.- The coherence of languages withintersection types.- Singleton, union and intersection types for program extraction.- Subtyping + extensionality: Confluence of ??top reduction in F?.- An extension of system F with subtyping.- Will logicians be replaced by machines?.
| Erscheint lt. Verlag | 28.8.1991 |
|---|---|
| Reihe/Serie | Lecture Notes in Computer Science |
| Zusatzinfo | X, 776 p. |
| Verlagsort | Berlin |
| Sprache | englisch |
| Maße | 155 x 235 mm |
| Gewicht | 1061 g |
| Themenwelt | Mathematik / Informatik ► Informatik ► Programmiersprachen / -werkzeuge |
| Mathematik / Informatik ► Informatik ► Software Entwicklung | |
| Informatik ► Theorie / Studium ► Compilerbau | |
| Schlagworte | Attribut • Complexity • constructive logic • Delegation • Design • Hardcover, Softcover / Informatik, EDV/Programmiersprachen • HC/Informatik, EDV/Programmiersprachen • Konstruktive Logik • Logic • Mathematische Logik • Polymorphism • Programm • Programmiersysteme • programming • Programming Systems • Software-Engineering • Software Engineering / Softwareentwicklung • Softwareentwicklung • Testing • Theory of Computation • Typentheorie • Type Theory • wissenschaftliches Rechen |
| ISBN-10 | 3-540-54415-1 / 3540544151 |
| ISBN-13 | 978-3-540-54415-9 / 9783540544159 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich
