The following pages link to CLEAN (Q14086):
Displaying 30 items.
- Lazy productivity via termination (Q549188) (← links)
- Space-efficient gradual typing (Q656856) (← links)
- Making ``stricterness'' more relevant (Q656871) (← links)
- Properties of a first-order functional language with sharing (Q673126) (← links)
- Refined typing to localize the impact of forced strictness on free theorems (Q766167) (← links)
- Implementing term rewrite languages in DACTL (Q912591) (← links)
- Generic programming in 3D (Q923888) (← links)
- Detection and parameter estimation of multicomponent LFM signal based on the cubic phase function (Q938976) (← links)
- Generalized time-frequency distributions for multicomponent polynomial phase signals (Q971342) (← links)
- Context-sensitive dependency pairs (Q989290) (← links)
- Modified adaptive chirplet decomposition with application in ISAR imaging of maneuvering targets (Q1015948) (← links)
- Normalization results for typeable rewrite systems (Q1357006) (← links)
- A quasi-parametric algorithm for synthetic aperture radar target feature extraction and imaging with angle diversity (Q1581808) (← links)
- Context-sensitive rewriting strategies (Q1854569) (← links)
- Techniques to improve the CLEAN deconvolution algorithm (Q1921949) (← links)
- Trends in trends in functional programming 1999/2000 versus 2007/2008 (Q1929344) (← links)
- Uniqueness logic (Q2368939) (← links)
- SAC -- a functional array language for efficient multi-threaded execution (Q2431843) (← links)
- Algebraic correctness proofs for compiling recursive function definitions with strictness information (Q2502270) (← links)
- Code-carrying theories (Q2643124) (← links)
- (Q2740996) (← links)
- Lenient evaluation is neither strict nor lazy (Q2745736) (← links)
- (Q2763390) (← links)
- Programmed Strategies for Program Verification (Q2864527) (← links)
- Type classes for mathematics in type theory (Q3094177) (← links)
- (Q3104401) (← links)
- Comprehending Ringads (Q3188283) (← links)
- Proving Properties of Lazy Functional Programs with Sparkle (Q3599177) (← links)
- Ivor, a Proof Engine (Q3612951) (← links)
- Deciding inclusion of set constants over infinite non-strict data structures (Q5441550) (← links)
