Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Result type

In functional programming, a result type is a Monadic type holding a returned value or an error code. They provide an elegant way of handling errors… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
We propose a type system for functional languages with gradual types and set-theoretic type connectives and prove its soundness… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 7
Is this relevant?
2014
2014
We present guided type debugging as a new approach to quickly and reliably remove type errors from functional programs. The… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2012
2012
Keyword search enables inexperienced users to easily search XML database with no specific knowledge of complex structured query… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2010
2010
Although keyword query enables inexperienced users to easily search XML database with no specific knowledge of complex structured… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2008
Highly Cited
2008
Web search engines today typically show results as a list of titles and short snippets that summarize how the retrieved documents… Expand
  • table 1
  • figure 1
  • table 3
  • figure 2
  • table 5
Is this relevant?
Highly Cited
2002
Highly Cited
2002
Let S be some type system. A typing in S for a typable term M is the collection of all of the information other than M which… Expand
Is this relevant?
Highly Cited
1999
Highly Cited
1999
  • Martin Hofmann
  • Proceedings. 14th Symposium on Logic in Computer…
  • 1999
  • Corpus ID: 2498144
We propose a linear type system with recursion operators for inductive datatypes which ensures that all definable functions are… Expand
Is this relevant?
1999
1999
The result type of an interpreter written in a typed language is normally a tagged union. By using depent types, we can be more… Expand
Is this relevant?
Highly Cited
1998
Highly Cited
1998
Cayenne is a Haskell-like language. The main difference between Haskell and Cayenne is that Cayenne has dependent types, i.e… Expand
  • figure 1
Is this relevant?
1996
1996
We present a verification of a distributed sorting algorithm in ALF, an implementation of Martin L¨of's type theory. The… Expand
Is this relevant?