Browsing by Author "Jay Barry"

UTSePress Research/Manakin Repository

Search UTSePress Research

Browse

My Account

Browsing by Author "Jay Barry"

Sort by: Order: Results:

  • Adaptiveness in Well-Typed java bytecode verification 
    Jay Barry; Huang Freeman; Skillicorn David (Association for Computing Machinery, 2006)
    Research on security techniques for Java bytecode has paid little attention to the security of the implementations of the techniques themselves, assuming that ordinary tools for programming, verification and testing ...
  • A Combinatory Account of Internal Structure 
    Jay Barry; Given-Wilson Thomas (Assn Symbolic Logic Inc, 2011)
    Traditional combinatory logic uses combinators S and K to represent all Turing-computable functions on natural numbers, but there are Turing-computable functions on the combinators themselves that cannot be so represented, ...
  • Concurrent Pattern Calculus 
    Given-Wilson Thomas; Gorla Daniele; Jay Barry (Springer, 2010)
    Concurrent pattern calculus drives interaction between processes by unifying patterns, just as sequential pattern calculus drives computation by matching a pattern against a data structure. By generalising from pattern ...
  • First-class patterns 
    Jay Barry; Kesner D (Cambridge Univ Press, 2009)
    Pure pattern calculus supports pattern-matching functions in which patterns are first-class citizens that can be passed as parameters, evaluated and returned as results. This new expressive power supports two new forms of ...
  • The Pattern Calculus 
    Jay Barry (ACM Press, 2004)
    There is a significant class of operations such as mapping that are common to all data structures. The goal of generic programming is to support these operations on arbitrary data types without having to recode for each ...
  • Pattern Calculus: Computing with Functions and Structures 
    Jay Barry (Springer, 2009)
    The pattern calculus is a new foundation for computation, in which the expressive power of functions and of data structures are fruitfully combined within pattern-matching functions. The best of existing foundations focus ...
  • The Polymorphic Imperative: a Generic Approach to In-place Update 
    Jay Barry; Lu Hai Yan; Nguyen Quy Tuan (Elsevier, 2004)
    The constructor calculus supports generic operations defined over arbitrary data types including abstract data types. This paper extends the basic constructor calculus to handle constructed locations. The resulting calculus ...
  • Programming with Heterogeneous Structures: Manipulating XML data Using bondi 
    Huang Freeman; Jay Barry; Skillicorn David (Australian Computer Society Inc, 2006)
    Manipulating semistructured data such as XML does not fit well within conventional programming languages A typical manipulation requires finding all occurrences of a structure matching a structured search pattern whose ...
  • Pure pattern calculus 
    Jay Barry; Kesner D (Springer-Verlag, 2006)
    The pure pattern calculus generalises the pure lambda-calculus by basing computation on pattern-matching instead of beta-reduction. The simplicity and power of the calculus derive from allowing any term to be a pattern. ...
  • A relational Account of Objects 
    Murdaca Clara; Jay Barry (Australian Computer Society, 2006)
    A relational account of objects provides a single unifying data model for both object-oriented programming languages and relational databases. Type variables used to represent unknown fields in the programming language ...
  • Scrap Your Type Applications 
    Jay Barry; Jones Simon (Springer, 2008)
    We intoduce System IF, for implicit System F, in which many type applications can be made implicit. It supports decidable type checking and strong normalisation. System IF constitutes a first foray into a new area in the ...
  • Typed Self-Interpretation by Pattern Matching 
    Jay Barry; Palsberg Jens (ACMPress, 2011)
    Self-interpreters can be roughly divided into two sorts: self-recognisers that recover the input program from a canonical representation, and self-enactors that execute the input program. Major progress for statistically-typed ...