Theoretical aspects of computer software : [first] International Conference, TACS'91, Sendai, Japan, September 24-27, 1991 : proceedings
TACS'91 is the first International Conference on Theoretical Aspects of Computer Science held at Tohoku University, Japan, in September 1991. This volume contains 37 papers and an abstract for the talks presented at the conference. TACS'91 focused on theoretical foundations of programming,...
Guardat en:
| Autor corporatiu: | |
|---|---|
| Altres autors: | , |
| Format: | Livre numérique |
| Idioma: | Anglais |
| Publicat: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Col·lecció: | Lecture notes in computer science
526 |
| Matèries: | |
| Accés en línia: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Nota: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Theoretical aspects of computer software, International Conference, TACS'91, Sendai, Japan, September 24-27, 1991, proceedings, T. Ito, A.R. Meyer, eds, Berlin, Springer-Verlag, 1991, 1 vol. (X-770 p.), Lecture notes in computer science, 0-387-54415-1 • Theoretical Aspects of Computer Software, Texte imprimé, 9783662211663 |
Taula de continguts:
- 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?.