We propose to extend the standard algebraic specification framework by incorporating user-defined type constructors that accept types and data as arguments. Together with the concept of term construction, this enhancement provides a powerful type system that includes parametric polymorphism and dependent types. Typing restrictions are specified by a small set of axioms and deduction rules. A type-checking algorithm is developed and proven to be sound with respect to the typing rules. This work has been developed in the framework of the specification language SEGRAS
Bidirectional typechecking, in which terms either synthesize a type or are checked against a known t...
Bidirectional typechecking, in which terms either synthesize a type or are checked against a known t...
We investigate parametrization for order-sorted algebraic specifications. As a prerequisite we study...
Algebraic specification frameworks exploit a variety of sort disciplines. The treatment of sorts has...
This paper describes structural polymorphism, a new form of type polymorphism appropriate to functio...
This thesis revisits the well-known notion of parametric polymorphismin the light of modern developm...
This thesis presents the foundations for relational logic programming over polymorphically order-so...
An important feature of modern computer algebra systems is the support of a rich type system with th...
This thesis revisits the well-known notion of parametric polymorphism in the light of modern develop...
One of the disadvantages of statically typed languages is the pro-gramming overhead caused by writin...
Modem functional languages feature polymorphic types whose data structures must be fixed, though the...
International audienceWe propose a type system based on regular tree grammars, where algebraic datat...
AbstractThis paper is concerned with the type structure of a system including polymorphism, type pro...
In this chapter, we propose a framework for logic programming with different type systems. In this f...
This paper concentrates on a polymorphic type system with constraints based on constrained types. By...
Bidirectional typechecking, in which terms either synthesize a type or are checked against a known t...
Bidirectional typechecking, in which terms either synthesize a type or are checked against a known t...
We investigate parametrization for order-sorted algebraic specifications. As a prerequisite we study...
Algebraic specification frameworks exploit a variety of sort disciplines. The treatment of sorts has...
This paper describes structural polymorphism, a new form of type polymorphism appropriate to functio...
This thesis revisits the well-known notion of parametric polymorphismin the light of modern developm...
This thesis presents the foundations for relational logic programming over polymorphically order-so...
An important feature of modern computer algebra systems is the support of a rich type system with th...
This thesis revisits the well-known notion of parametric polymorphism in the light of modern develop...
One of the disadvantages of statically typed languages is the pro-gramming overhead caused by writin...
Modem functional languages feature polymorphic types whose data structures must be fixed, though the...
International audienceWe propose a type system based on regular tree grammars, where algebraic datat...
AbstractThis paper is concerned with the type structure of a system including polymorphism, type pro...
In this chapter, we propose a framework for logic programming with different type systems. In this f...
This paper concentrates on a polymorphic type system with constraints based on constrained types. By...
Bidirectional typechecking, in which terms either synthesize a type or are checked against a known t...
Bidirectional typechecking, in which terms either synthesize a type or are checked against a known t...
We investigate parametrization for order-sorted algebraic specifications. As a prerequisite we study...