Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Jonathan Fowler

dblp:01/724 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
0since 2021 · last 2017
0009-0004-3888-2878ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 1Software engineering, systems software and programming languages · 1 · 1 first-authorTheory of computation · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Software engineering, system software, and programming languages
1 paper
Programming languages and type systems · 100%
Theoretical computer science
1 paper
Logic in computer science · 100%

Topics — the 2 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Programming languages and type systems › computational effects
monads
0.312017
The continuity of monadic stream functions · LICS 2017
Programming languages and type systems
type theory
0.312017
The continuity of monadic stream functions · LICS 2017

Methods — techniques the papers use, named apart from their topics

modulus of continuity · 0.6dialogue trees · 0.6
YearPublicationVenuePosition
2017 The continuity of monadic stream functions
abstract
Brouwer's continuity principle states that all functions from infinite sequences of naturals to naturals are continuous, that is, for every sequence the result depends only on a finite initial segment. It is an intuitionistic axiom that is incompatible with classical mathematics. Recently Martín Escardό proved that it is also inconsistent in type theory. This shows that we cannot internalize the meta-theoretical observation that every definable function is continuous. However, we can adapt Brouwer's ideas to an important class of functions and propose a reformulation of the continuity principle that is internally provable. We note that Brouwer talked about functions on choice sequences, which are described as free progressions of values not necessarily generated by a rule. The functions must produce their results independently of how the sequences are generated. We formalize them as monadic streams, potentially unending sequences of values produced by steps triggered by a monadic action, possibly involving side effects. We consider functions on them that are uniform, in the sense that they operate in the same way independently of the particular monad that provides the specific side effects. Formally this is done by requiring a form of naturality in the monad. Functions on monadic streams have not only a foundational importance, but have also practical applications in signal processing and reactive programming. We give algorithms to determine the modulus of continuity of monadic stream functions and to generate dialogue trees for them (trees whose nodes and branches describe the interaction of the process with the environment).
Venanzio Capretta, Jonathan Fowler
LICS2
2017 Failing Faster: Overlapping Patterns for Property-Based Testing
Jonathan Fowler, Graham Hutton
PADL1
1996 An algorithm for power estimation in switched-capacitor circuits
abstract
A number of low-power designs, such as those for mobile communication equipment, contain switched-capacitor circuits. In such designs it is important to be able to estimate the power dissipated by the switched-capacitor portion of the circuit. This paper describes an algorithm for the computation of statistical information about the power dissipated in a switched-capacitor circuit when corresponding statistical information about the inputs to the circuit is known. Ordinary circuit simulators are not suited for this task. Because they can only compute the power dissipated by the circuit for one specific set of input signals. The algorithm does not require Monte-Carlo analyses, and it accounts for correlation among the inputs. To demonstrate the algorithm's performance, numerical results obtained on a number of sample switched-capacitor circuits are reported.
Chad Young, Giorgio Casinovi, Jonathan Fowler, Paul Kerstetter
ICCAD3