H ? « ‹ ← → › »

Language peer sets for Xfun:
France↑
France/1991↑
Designed 1991 ↑
1990s languages ↑
Fifth generation↑
Post-Cold War↑

Xfun(ID:1668/xfu001)

alternate simple view

Country: France
Designed 1991
Published: 1991

S. Dalmas, INRIA, 1991. A hybrid of SML and Russell

Related languages

RUSSELL	→	Xfun		Influence
SML	→	Xfun		Evolution of

References:

Dalmas, S (1992) Dalmas, S "A Polymorphic Functional language Applied to Symbolic Computation"
in (1992) Proc Intl Symp Symb Alg Comp, Berkeley 1992
Resources

Home page of Stéphane Dalmas at Inria Programming languages for symbolic computations

The subject of my PhD thesis was the design of a typed language suitable to express the level of polymorphism necessary to express the mathematical algorithms of computer algebra in their full generality. The resulting language, XFun , is a strongly typed functional programming language. XFun is not a language specialized for algebraic computation but a general purpose language, intended to explore what a sophisticated type system can bring to software engineering: to write reusable software components and to manage large software systems and their evolution. It can be used to describe mathematical objects and structures in a spirit similar to the one of Scratchpad (now the Axiom system with the Aldor language, developped by NAG). A prototype implementation of XFun was produced that generated C code, using parts of the SML/NJ compiler.

Search in: Google Google scholar World Cat Yahoo Overture DBLP Monash bib NZ IEEE ACM portal CiteSeer CSB ncstrl jstor Bookfinder