Epigram

Known as: Epigram (disambiguation), Epigram language, Epigram programming language 
Epigram is a functional programming language with dependent types. Epigram also refers to the IDE usually packaged with the language. Epigram's type… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1942-2017
0246819422016

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Most dependently-typed programming languages either require that all expressions terminate (e.g. Coq, Agda, and Epigram), or… (More)
  • figure 5
Is this relevant?
Review
2011
Review
2011
  • D G Angelakis
  • 2011 International Quantum Electronics Conference…
  • 2011
I will start by describing the basic motivation for using strongly interacting systems of photons to simulate condensed matter… (More)
Is this relevant?
2010
2010
It would not be too much of a stretch to imagine that dependent types will be the next big thing in programming language research… (More)
Is this relevant?
Highly Cited
2007
Highly Cited
2007
This paper has something new and positive to say about propositional equality in programming and proof systems based on the Curry… (More)
Is this relevant?
2006
2006
Conventional approaches to compiler correctness, type safety and type preservation have focused on off-line proofs, either on… (More)
Is this relevant?
Highly Cited
2006
Highly Cited
2006
Language designers have in recent years proposed a wealth of richer type systems for programming which seek to extend the range… (More)
  • figure 1
  • figure 2
Is this relevant?
2005
2005
Epigram 1 [18, 3] is at the same time a functional programming language with dependent types and a type-driven, interactive… (More)
  • figure 1
  • figure 2
Is this relevant?
2005
2005
It is commonly believed that in dependently typed programming languages, the blurring of the distinction between types and values… (More)
Is this relevant?
Highly Cited
2004
Highly Cited
2004
You can’t, of course: this program is obviously nonsense unless you’re a typechecker. The trouble is that only certain… (More)
  • figure 1
Is this relevant?
2004
2004
In this paper we use the Epigram language to define the universe of regular tree types—closed under empty, unit, sum, product and… (More)
  • figure 1
Is this relevant?