Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

10 relations
Calling conventionFunction-level programmingFunctional programmingLazy evaluation

Broader (2)

Denotational semanticsFormal methods

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
Strong Lexicalization of Tree Adjoining Grammars
Recently, it was shown (KUHLMANN, SATTA: Tree-adjoining grammars are not closed under strong lexicalization. Comput. Linguist… 
2011
2011
The Volcker Rule and Evolving Financial Markets
The Volcker Rule prohibits proprietary trading by banking entities - in effect, reintroducing to the financial markets a… 
Highly Cited
2007
Highly Cited
2007
An Optimal Decision Procedure for Right Propositional Neighborhood Logic
Propositional interval temporal logics are quite expressive temporal logics that allow one to naturally express statements that… 
2006
2006
Partiality I: Embedding relation algebras
1998
1998
Overlapping execution with transfer using non-strict execution for mobile programs
In order to execute a program on a remote computer, it mustfirst be transferred over a network. This transmission incurs the over… 
1997
1997
Report on the Non-Strict Functional Language
1994
1994
Execution profiling for non-strict functional languages
Profiling tools, which measure and display the dynamic space and time behaviour of programs, are essential for identifying… 
1992
1992
A Functional DBPL Revealing High Level Optimizations
We present a functional DBPL in the style of FP that facilitates the definition of precise semantics and opens up opportunities… 
1992
1992
Declarative Debugging of Lazy Functional Programs
We show how declarative (or algorithmic) debugging can be applied to lazy functional programming and describe a prototype… 
1984
1984
Busy and lazy FP with infinite objects
The paper introduces a variant of Backus' functional programming language FP that has non-strict basic operations as well as non… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)