Keywords. Functional programming, reactive programming, interaction, dependent types, monadic I/O, repetition constructs, refinement.
Representations of Stream Processors Using Nested Fixed Points (2009)
Ghani, Neil, Hancock, Peter, Pattinson, Dirk
We define representations of continuous functions on infinite streams of discrete values, both in the case of discrete-valued functions, and in the case of stream-valued functions. We define also an...
Programming interfaces and basic topology (2009)
Hancock, Peter, Hyvernat, Pierre
A pattern of interaction that arises again and again in programming is a "handshake", in which two agents exchange data. The exchange is thought of as provision of a service. Each interaction is...
6.1 Power, Women's Employment and the Gender Empowerment Measure: voices from Sri Lankan women who work in export processing zones
1.1 The lived experience of female factory workers in rural West Java (2009)
The lived experience of female factory workers in rural West Java
Thorsten Altenkirch, Neil Ghani, Peter Hancock, Conor Mcbride, Peter Morris
Abstract. The search for an expressive calculus of datatypes in which canonical algorithms can be easily written and proven correct has proved to be an enduring challenge to the theoretical computer...
Citations (this article cites 10 articles hosted on the
ADVANCING HUMAN CENTERED AUGMENTED REALITY RESEARCH (2008)
Brian Goldiez, Mark A. Livingston, Jeffrey Dawson, Dennis Brown, Peter Hancock, Yohan Baillot, ...
Augmented Reality (AR) is an emerging technology that offers possibilities that other technologies are not able to fulfill. AR uses a computer to add information to the real world. Future AR...
Thorsten Altenkirch, Neil Ghani, Peter Hancock, Conor Mcbride, Peter Morris
Abstract. The search for an expressive calculus of datatypes in which canonical algorithms can be easily written and proven correct has proved to be an enduring challenge to the theoretical computer...
Markus Michelbrink, Sa Pp, Peter Hancock
type theory in order to represent interactive programming. The rules essentially reflect the existence of weakly final coalgebras for a general form of polynomial functor. The standard rules of...
Dependently Typed Programming (2008)
Anton Setzer, Peter Hancock, A. Setzer, P. Hancock
Abstract. We reconsider the representation of interactive programs in dependent type theory that the authors proposed in earlier papers. Whereas in previous versions the type of interactive programs...
Interactive programs and weakly final coalgebras (extended version (2008)
GR/S30450/01. 2 A. Setzer, P. Hancock 1 Introduction According to Martin-L"of [19]: "... I do not think that the search for logically ever more satisfac-tory high level programming...
Interactive programs and weakly final coalgebras (extended version (2008)
We reconsider the representation of interactive programs in dependent type theory, proposed by the authors in earlier papers. The basis of this approach is monadic I/O as used in Haskell. We consider...
Interactive programs and weakly final coalgebras (extended version (2008)
Abstract. We reconsider the representation of interactive programs in dependent type theory that the authors proposed in earlier papers. Whereas in previous versions the type of interactive programs...
Abstract. We propose a representation of interactive systems in dependent type theory. This is meant as a basis for an execution environment for dependently typed programs, and for reasoning about...
DRAFT Interaction, computer science and formal topology (2007)
Formal topology seems to have great relevance for programming. Programming is in some sense the science of how to get \there " from \here", or hodology. The structures studied in...
DRAFT Interaction, computer science and formal topology (2007)
A pattern of interaction that arises again and again in programming, is a \handshake", in which two agents exchange data. The exchange is thought of as provision of a service. The...
Abstract. We propose a representation of interactive systems in dependent type theory. This is meant as a basis for an execution environment for dependently typed programs, and for reasoning about...
We want to arrange and relate the following notions connected with state machines and their specications. So far the points of interest are that Mealy machines and Moore machines are complementary;...
Abstract. We propose a representation of interactive systems in dependent type theory. This is meant as a basis for an execution environment for dependently typed programs, and for reasoning about...
Abstract. We propose a representation of interactive systems in dependent type theory. This is meant as a basis for an execution environment for dependently typed programs, and for reasoning about...
Peter Hancock Abandoned, Peter Hancock
There are many combinatorially complete sets of combinators, or `instruction sets' to which the -calculus can be compiled. The most famous are perhaps fS; K g and fB;C;K;W g. Several authors...
Brouwerian stream processors (2007)
Neil Ghani, Peter Hancock, Dirk Pattinson
We define representations of continuous functions on infinite streams of discrete values, both in the case of discrete-valued functions, and in the case of stream-valued functions. We define also an...
Continuous functions on final coalgebras (2007)
Neil Ghani, Peter Hancock, Dirk Pattinson
In a previous paper we have given a representation of continuous functions on streams, both discrete-valued functions, and functions between streams. the topology on streams is the ‘Baire ’...
Barriers to respite: A study of a sub-group from an Older Carers Program in Western Australia (2006)
Programming interfaces and basic topology (2006)
Hancock, Peter, Hyvernat, Pierre
A pattern of interaction that arises again and again in programming is a "handshake", in which two agents exchange data. The exchange is thought of as provision of a service. Each interaction is...
Programming interfaces and basic topology (2006)
Hancock, Peter, Hyvernat, Pierre
A pattern of interaction that arises again and again in programming is a "handshake", in which two agents exchange data. The exchange is thought of as provision of a service. Each interaction is...
Programming interfaces and basic topology (2005)
Peter Hancock, Pierre Hyvernat
A pattern of interaction that arises again and again in programming, is a “handshake”, in which two agents exchange data. The exchange is thought of as provision of a service. Each interaction is...
Interactive Programs and Weakly Final Coalgebras in Dependent Type Theory (Extended Version) (2005)
We reconsider the representation of interactive programs in dependent type theory that the authors proposed in earlier papers. Whereas in previous versions the type of interactive programs was...
Guarded Induction and Weakly Final Coalgebras in Dependent Type Theory (2004)
We introduce concepts for representing interactive programs in dependent type theory. The representation uses a monad, as in Haskell. We consider two versions, one, in which the interface with the...
Human female attractiveness: waveform analysis of body shape (2002)
Tovee, Martin, Hancock, Peter, Mahmoodi, Sasan, Singleton, Ben, Cornelissen, Piers
Two putative cues to female physical attractiveness are body mass index (BMI) and shape (particularly the waist–hip ratio or WHR). To determine the relative importance of these cues we asked 23...
Interaction, computer science and formal topology (2002)
Peter Hancock, Pierre Hyvernat
A pattern of interaction that arises again and again in programming, is a “handshake”, in which two agents exchange data. The exchange is thought of as provision of a service. The interaction is...
Ordinals and Interactive Programs (2000)
The work reported in this thesis arises from the old idea, going back to the origins of constructive logic, that a proof is fundamentally a kind of program. If proofs can be considered as programs,...
Ordinals and Interactive Programs (2000)
The work reported in this thesis arises from the old idea, going back to the origins of constructive logic, that a proof is fundamentally a kind of program. If proofs can be considered as programs,...
The lived experience of female factory workers in rural West Java (2000)
This article focuses on the lived experiences of rural factory women in West Java. The women discussed currently work and have lived all their lives in Banjaran, a rapidly industrialising district of...
The lived experience of female factory workers in rural West Java (2000)
This article focuses on the lived experiences of rural factory women in West Java. The women discussed currently work and have lived all their lives in Banjaran, a rapidly industrialising district of...
The lived experience of female factory workers in rural West Java (2000)
This article focuses on the lived experiences of rural factory women in West Java. The women discussed currently work and have lived all their lives in Banjaran, a rapidly industrialising district of...
The lived experience of female factory workers in rural West Java (2000)
This article focuses on the lived experiences of rural factory women in West Java. The women discussed currently work and have lived all their lives in Banjaran, a rapidly industrialising district of...
Ordinals and Interactive Programs (2000)
Peter Hancock, For Robin Gandy
The work reported in this thesis arises from the old idea, going back to the origins of constructive logic, that a proof is fundamentally a kind of program. If proofs can be considered as programs,...
Specifying interactions with dependent types (2000)
There are several practical approaches to modelling input output for functional programs. Two examples are the IO monad of Haskell, and the uniqueness types of Clean. Some of the basic ideas are...
Ordinals and Interactive Programs (2000)
Peter Hancock, For Robin Gandy
The work reported in this thesis arises from the old idea, going back to the origins of constructive logic, that a proof is fundamentally a kind of program.
Specifying interactions with dependent types (2000)
1 Introduction There are several practical approaches to modelling input\Gamma output for functional programs. Two examples are the IO\Gamma monad of Haskell, and the uniqueness types of Clean. Some...
Interactive programs in dependent type theory (2000)
Abstract. We propose a representation of interactive systems in dependent type theory. This is meant as a basis for an execution environment for dependently typed programs, and for reasoning about...
The lived experience of female factory workers in rural West Java (2000)
This article focuses on the lived experiences of rural factory women in West Java. The women discussed currently work and have lived all their lives in Banjaran, a rapidly industrialising district of...
Metal entrainment in continuous liquid phase drosses (1994)
A comprehensive characterization of silver and bismuth refining crusts produced during the pyrometallurgical refining of lead was undertaken. Parameters such as intermetallic crystal size and...
An Empirical Comparison of Selection Methods in Evolutionary Algorithms (1994)
Selection methods in Evolutionary Algorithms, including Genetic Algorithms, Evolution Strategies #ES# and Evolutionary Programming, #EP# are compared by observing the rate of convergence on three...
Metal entrainment in continuous liquid phase drosses (1994)
A comprehensive characterization of silver and bismuth refining crusts produced during the pyrometallurgical refining of lead was undertaken. Parameters such as intermetallic crystal size and...
The specification of neural net architectures by genetic algorithm is thought to be hampered by difficulties with crossover. This is the "permutation" or "competing conventions"...
Capital city urban design with special reference to a parliamentary capital for South Africa /
Thesis (D.Phil.) - University of the Orange Free State, 1995.
A Proposal for Expensing Employee Compensatory Stock Options for Financial Reporting Purposes
Peter Hancock, Roberto G. Mendoza, Robert C. Merton
This article presents an accounting approach for employee stock options based on the insight that the currentperiod compensation expense should reflect only that part of the option value that is...
Thesis (D.Phil.) - Universiteit van die Orange Free State, 1995.
Evaluation of the Integrated Services Pilot Program from Western Australia
Hancock, Peter, Cooper, Trudi, Bahn, Susanne
Independent evaluation of refugee-focused programs in developed nations is increasingly a mandatory requirement of funding bodies and government agencies. This paper presents an evaluation of the...