ALDOR

Aldor is a programming language with an expressive type system well-suited for mathematical computing and which has been used to develop a number of computer algebra libraries. Originally known as A#, Aldor was conceived as an extension language for the Axiom system, but is now used more in other settings.In Aldor, types and functions are first class values that can be constructed and manipulated within programs. Pervasive support for dependent types allows static checking of dynamic objects. What does this mean for a normal user? Aldor solves many difficulties encountered in widely-used object-oriented programming languages. It allows programs to use a natural style, combining the more attractive and powerful properties of functional, object-oriented and aspect-oriented styles. Note: Current development happens at https://github.com/pippijn/aldor.


References in zbMATH (referenced in 21 articles )

Showing results 1 to 20 of 21.
Sorted by year (citations)

1 2 next

  1. van der Hoeven, Joris: Overview of the Mathemagix type system (2014)
  2. Dos Reis, Gabriel; Matthews, David; Li, Yue: Retargeting OpenAxiom to Poly/ML: towards an integrated proof assistants and computer algebra system framework (2011)
  3. Kredel, Heinz: Unique factorization domains in the Java computer algebra system (2011)
  4. Dragan, Laurentiu; Watt, Stephen M.: Type specialization in Aldor (2010)
  5. Kredel, Heinz; Jolly, Raphael: Generic, type-safe and object oriented computer algebra software (2010)
  6. Kredel, Heinz: On a Java computer algebra system, its performance and applications (2008)
  7. Kredel, Heinz: Evaluation of a Java computer algebra system (2008)
  8. Liang, Songxin; Jeffrey, David J.: Rule-based simplification in vector-product spaces (2007)
  9. Moreno Maza, Marc (ed.); Watt, Stephen M. (ed.): PASCO’07. Proceedings of the 2007 international workshop on parallel symbolic computation, London, ON, Canada, July 27--28, 2007. (2007)
  10. Dragan, Laurentiu; Watt, Stephen M.: On the performance of parametric polymorphism in Maple (2006)
  11. Naylor, William; Padget, Julian: From untyped to polymorphically typed objects in mathematical web services (2006)
  12. Dragan, Laurentiu; Watt, Stephen M.: Parametric polymorphism optimization for deeply nested types in computer algebras (2005)
  13. Oancea, Cosmin E.; Watt, Stephen M.: Domains and expressions: an interface between two approaches to computer algebra (2005)
  14. Ashby, T.; Galletly, D.; Joó, B.; Kennedy, A.D.; Lacagnina, G.: The Paraldor project (2003)
  15. Bronstein, Manuel: $\Sigma^it$ -- an ALDOR library for linear differential and difference equations. (Abstract) (2002)
  16. Cohen, Arjeh M. (ed.); Gao, Xiao-Shan (ed.); Takayama, Nobuki (ed.): Mathematical software. Proceedings of the 1st international congress, Beijing, China, August 17--19, 2002 (2002)
  17. Watt, Stephen M.: A study in the integration of computer algebra systems: Memory management in a Maple-Aldor environment. (2002)
  18. Ballarin, Clemens; Paulson, Lawrence C.: A pragmatic approach to extending provers by computer algebra -- with applications to coding theory (1999)
  19. Ballarin, Clemens; Paulson, Lawrence C.: Reasoning about coding theory: The benefits we get from computer algebra (1998)
  20. Bachmann, Olaf; Schönemann, Hans; Gray, Simon: A proposal for syntactic data integration for Math protocols (1997)

1 2 next