Strict function

Known as: Non-strict, Non-strict function, Strict semantics 
A function f is said to be strict if, when applied to a non-terminating expression, it also fails to terminate. A strict function in the denotational… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2002
2002
In this paper we present the first exception analysis for a non-strict language. We augment a simply-typed functional language… (More)
  • figure 1
  • figure 3
  • figure 5
Is this relevant?
2002
2002
If the UML is to continue to meet the expectations of its ever-growing user community it is essential that it offer a simple and… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1996
Highly Cited
1996
In functional languages intermediate data structures are often used as glue to connect separate parts of a program together… (More)
Is this relevant?
1993
1993
This paper proposes a formalism for reasoning about distributed object-oriented computations. The formalism is an extension of… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1991
Highly Cited
1991
The code compiled from a non-strict functional program usually manipulates heap-allocated boxed numbers. Compilers for such… (More)
Is this relevant?
Highly Cited
1991
Highly Cited
1991
Functional programs are widely appreciated for being \declarative" (algorithms are not over-speciied) and implicitly parallel… (More)
Is this relevant?
Highly Cited
1991
Highly Cited
1991
The &-Prolog system, a practical implementation of a parallel execution model for Prolog exploiting strict and non-strict… (More)
Is this relevant?
1989
1989
This paper presents and proves some fundamental results for independent and-parallelism (IAP). First, the paper treats the issues… (More)
Is this relevant?
1989
1989
Non-strict evaluation improves the expressive power of functional languages at the expense of an apparent loss of eeciency. In… (More)
Is this relevant?
Highly Cited
1988
Highly Cited
1988
A necessary and sufficient condition on the Walsh-spectrum of a boolean function is given, which implies that this function… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
Is this relevant?