Functional Programming Projects

Hume
Hume is a domain-specific high-level programming language for real-time embedded systems.
EmBounded Project
The EmBounded Project aims to identify, quantify and certify resource-bounded code in Hume using formal models of resource consumption.
SEAS
A collaborative project between BAe, Heriot-Watt University and the University of St Andrews to develop proven software for sensor exploitation with predictable resource needs.
SCIEnce
The goal of the SCIEnce (Symbolic Computation Infrastructure for Europe) project is to improve integration between key world-leading developers and application experts in Symbolic Computation software systems. Such systems form a vital infrastructural tool in areas of modern academic and commercial research, with important applications in Mathematics, Physics, Chemistry, Computer Science, Engineering and other technical disciplines.
Epigram
Epigram is a dependently typed programming language and an interactive programming environment.
Generative Programming for Embedded Systems
This project aims to develop formally based techniques for accurately and automatically costing and verifying the time and space usage of automatically generated programs.

Related Projects

GAP
GAP (Groups, Algorithms and Programming) is a system for computational discrete algebra with particular emphasis on, but not restricted to computational group theory. GAP was developed at Lehrstuhl D für Mathematik (LDfM), RWTH Aachen, Germany from 1986 to 1997. Following the retirement of J. Neubueser from the chair of LDfM, the development and maintenance of GAP is coordinated by the School of Computer Science at the University of St Andrews, Scotland.
Computational Logic Group
The group's work comprises the development of proof assistants and theorem-provers for various logics, the exploitation of various logics for problem specification or as programming languages, and the investigation of their proof theory and semantics.
APES (Algorithms, Problems, Empirical Studies)
Researches algorithms and problems for combinatorial search, like vehicle routing and constraint satisfaction. We are an international group with members at St Andrews, Glasgow, Leeds, Strathclyde, Edinburgh, and Alberta Universities.

This page was last modified on Monday 11 June 2007 10:54:49. This site is maintained by Robert Rothenberg (r r at cs dot st-andrews dot ac dot uk).