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

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2012
Highly Cited
2012
Data store replication results in a fundamental trade-off between operation latency and data consistency. In this paper, we… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
Highly Cited
1999
Highly Cited
1999
Abstract The peroxisome proliferator-activated receptor gamma (PPARγ) quickly evolved over the last decade from a new orphan… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1997
Highly Cited
1997
  • P. Sestoft
  • J. Funct. Program.
  • 1997
  • Corpus ID: 2392616
We derive a simple abstract machine for lazy evaluation of the lambda calculus, starting from Launchbury's natural semantics… Expand
Is this relevant?
Highly Cited
1993
Highly Cited
1993
We present a new model, based on monads, for performing input/output in a non-strict, purely functional language. It is… Expand
Is this relevant?
Highly Cited
1992
Highly Cited
1992
"Some half dozen persons have written technically on combinatory logic, and most of these, including ourselves, have published… Expand
  • figure I
Is this relevant?
Highly Cited
1992
Highly Cited
1992
Permission is hereby granted, free of charge, to any person obtaining a copy of “A Gentle Introduction to Haskell” (the Text), to… Expand
  • 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… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1987
Highly Cited
1987
The design space of object-based languages is characterized in terms of objects, classes, inheritance, data abstraction, strong… Expand
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
1987
Highly Cited
1987
The design space of object-based languages is characterized in terms of objects, classes, inheritance, data abstraction, strong… Expand
Is this relevant?
Highly Cited
1985
Highly Cited
1985
data types Many of the data types which in other languages would have to be expressed as abstract data types can be represented… Expand
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?