Sciweavers

184 search results - page 14 / 37
» Towards Formalizing Categorical Models of Type Theory in Typ...
Sort
View
TACS
1991
Springer
14 years 3 days ago
An Extension of System F with Subtyping
System F is a well-known typed λ-calculus with polymorphic types, which provides a basis for polymorphic programming languages. We study an extension of F, called F<: (pronoun...
Luca Cardelli, Simone Martini, John C. Mitchell, A...
TLCA
2007
Springer
14 years 2 months ago
Higher-Order Logic Programming Languages with Constraints: A Semantics
A Kripke Semantics is defined for a higher-order logic programming language with constraints, based on Church’s Theory of Types and a generic constraint formalism. Our syntactic...
James Lipton, Susana Nieva
DAGSTUHL
2001
13 years 10 months ago
Constructive Foundations for Featherweight Java
In this paper we present a recursion-theoretic denotational semantics for Featherweight Java. Our interpretation is based on a formalization of the object model of Castagna, Ghelli...
Thomas Studer
ICSE
1994
IEEE-ACM
14 years 20 days ago
Formalizing Architectural Connection
As software systems become more complex the overall system structure { or software architecture { becomes a central design problem. An important step towards an engineering discip...
Robert J. Allen, David Garlan
COGSR
2010
74views more  COGSR 2010»
13 years 3 months ago
Two qubits for C.G. Jung's theory of personality
We propose a formalization of C.G. Jung's theory of personality using a four-dimensional Hilbert-space for the representation of two qubits. The first qubit relates to Jung&#...
Reinhard Blutner, Elena Hochnadel