Recursive data type

Known as: Equirecursive type, Recursive type, Equirecursive 
In computer programming languages, a recursive data type (also known as a recursively-defined, inductively-defined or inductive data type) is a data… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1975-2017
051019752017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
We present the topos S of trees as a model of guarded recursion. We study the internal dependently-typed higher-order logic of S… (More)
Is this relevant?
2008
2008
In this paper, we present a symbolic reachability algorithm for process algebras with recursive data types. Like the various… (More)
  • table 6
  • figure 1
  • figure 2
  • table 7
  • table 8
Is this relevant?
2005
2005
As the processor-memory performance gap increases, so does the need for aggressive data structure optimizations to reduce memory… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
2005
2005
We consider type inference for guarded recursive data types (GRDTs) – a recent generalization of algebraic data types. We reduce… (More)
Is this relevant?
2005
2005
Existential types provide a simple and elegant foundation for understanding generative abstract data types, of the kind supported… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 7
Is this relevant?
2002
2002
In a previous work (“Abstract Data Type Systems”, TCS 173(2), 1997), the last two authors presented a combined language made of a… (More)
  • figure 1
Is this relevant?
Highly Cited
2001
Highly Cited
2001
In this paper we present a new parallel algorithm for data mining of association rules on shared-memory multiprocessors. We study… (More)
  • figure 1
  • figure 3
  • figure 4
  • table 1
  • figure 5
Is this relevant?
Highly Cited
1997
Highly Cited
1997
We present new sound and complete axiomatizations of type equality and subtype inequality for a first-order type language with… (More)
Is this relevant?
Highly Cited
1993
Highly Cited
1993
Subtyping in the presence of recursive types for the λ-calculus was studied by Amadio and Cardelli in 1991 [1]. In that… (More)
Is this relevant?
Highly Cited
1975
Highly Cited
1975
The power and convenience of a programming language may be enhanced for certain applications by permitting treelike data… (More)
  • figure 2
  • figure 3
Is this relevant?