CLEAN

swMATH1346MaRDI QIDQ14086FDOQ14086

Author name not available (Why is that?)

Cited In (55)

• Proving composed specifications of Clean programs in Sparkle-T
• Nonparametric spectral analysis of gapped data via an adaptive filtering approach
• Properties of a first-order functional language with sharing
• Generalized time-frequency distributions for multicomponent polynomial phase signals
• Lenient evaluation is neither strict nor lazy
• Type classes for mathematics in type theory
• Title not available (Why is that?)
• Evolution of a Parallel Task Combinator
• Functional Type Assignment for Featherweight Java
• Title not available (Why is that?)
• Lazy productivity via termination
• Detection and parameter estimation of multicomponent LFM signal based on the cubic phase function
• Functional and Logic Programming
• Programmed strategies for program verification
• Title not available (Why is that?)
• Ivor, a Proof Engine
• Title not available (Why is that?)
• Trends in trends in functional programming 1999/2000 versus 2007/2008
• Fourier interpolation and reconstruction via shannon-type techniques II. Technical developments and applications
• Uniqueness logic
• Techniques to improve the CLEAN deconvolution algorithm
• Title not available (Why is that?)
• Implementation of Functional Languages
• Title not available (Why is that?)
• Modelling Unique and Affine Typing Using Polymorphism
• Parallel graph rewriting on loosely coupled machine architectures
• Title not available (Why is that?)
• SAC -- a functional array language for efficient multi-threaded execution
• Title not available (Why is that?)
• Title not available (Why is that?)
• Temporal Properties of Clean Programs Proven in Sparkle-T
• Title not available (Why is that?)
• Radio-astronomical imaging in the presence of strong radio interference
• Algebraic correctness proofs for compiling recursive function definitions with strictness information
• Comprehending Ringads
• Title not available (Why is that?)
• Title not available (Why is that?)
• Implementing term rewrite languages in DACTL
• Generic programming in 3D
• Generic Programming with Multiple Parameters
• Making ``stricterness more relevant
• Space-efficient gradual typing
• Deciding inclusion of set constants over infinite non-strict data structures
• Functional Semantics
• Refined typing to localize the impact of forced strictness on free theorems
• Context-sensitive dependency pairs
• Modified adaptive chirplet decomposition with application in ISAR imaging of maneuvering targets
• Context-sensitive rewriting strategies
• Normalization results for typeable rewrite systems
• Title not available (Why is that?)
• A quasi-parametric algorithm for synthetic aperture radar target feature extraction and imaging with angle diversity
• Proving Properties of Lazy Functional Programs with Sparkle
• Code-carrying theories
• Promoting rewriting to a programming language: A compiler for non-deterministic rewrite programs in associative-commutative theories
• Title not available (Why is that?)

This page was built for software: CLEAN