Results 11 - 17 of 17

Exploring the regular tree types

by Peter Morris, Thorsten Altenkirch, Conor Mcbride - In Types for Proofs and Programs , 2004
"... Abstract. In this paper we use the Epigram language to define the universe of regular tree types—closed under empty, unit, sum, product and least fixpoint. We then present a generic decision procedure for Epigram’s in-built equality at each type, taking a complementary approach to that of Benke, Dyb ..."
Abstract - Cited by 23 (4 self) - Add to MetaCart
, Dybjer and Jansson [7]. We also give a generic definition of map, taking our inspiration from Jansson and Jeuring [21]. Finally, we equip the regular universe with the partial derivative which can be interpreted functionally as Huet’s notion of ‘zipper’, as suggested by McBride in [27] and implemented

Pull-Ups, Push-Downs, and Passing It Around Exercises in Functional Incrementalization

by Sean Leather, Johan Jeuring
"... Abstract. Programs in functional programming languages with alge-braic datatypes are often datatype-centric and use folds or fold-like func-tions. Incrementalization of such a program can significantly improve its performance. Functional incrementalization separates the recursion from the calculatio ..."
Abstract - Add to MetaCart
the calculation and significantly reduces redundant computation. In this paper, we motivate incrementalization with a simple example and present a library for transforming programs using upwards, down-wards, and circular incrementalization. We also give a datatype-generic implementation for the library

Clowns to the left of me, jokers to the right (pearl): dissecting data structures

by Conor Mcbride - Proceedings of the 35th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages , 2008
"... This paper introduces a small but useful generalisation to the ‘derivative ’ operation on datatypes underlying Huet’s notion of ‘zipper ’ (Huet 1997; McBride 2001; Abbott et al. 2005b), giving a concrete representation to one-hole contexts in data which is undergoing transformation. This operator, ‘ ..."
Abstract - Cited by 11 (1 self) - Add to MetaCart
This paper introduces a small but useful generalisation to the ‘derivative ’ operation on datatypes underlying Huet’s notion of ‘zipper ’ (Huet 1997; McBride 2001; Abbott et al. 2005b), giving a concrete representation to one-hole contexts in data which is undergoing transformation. This operator

A foundation for GADTs and inductive families: dependent polynomial functor approach

by Makoto Hamana, Marcelo Fiore - In WGP’11 , 2011
"... Every Algebraic Datatype (ADT) is characterised as the initial al-gebra of a polynomial functor on sets. This paper extends the char-acterisation to the case of more advanced datatypes: Generalised Algebraic Datatypes (GADTs) and Inductive Families. Specifi-cally, we show that GADTs and Inductive Fa ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
. In the context of ADTs, this fundamental result is the basis for various generic functional programming techniques. To estab-lish the usefulness of our approach for such developments in the broader context of inductively defined dependent types, we apply the theory to construct zippers for Inductive Families.

Using Information Theory to Reduce Complexities of Neural Networks in Protein Secondary Structure Prediction

by Boon Thye Thomas Yeo
"... Neural networks are commonly used in protein secondary structure prediction. However, neural networks tend to be very computationally expensive and time consuming because the training algorithms have to determine the values of thousands of variables that define the networks. In this paper, we sugges ..."
Abstract - Add to MetaCart
suggest a simple information theoretic method of pre-processing the training set before feeding it to a generic neural network, which should theoretically reduce the complexities of the neural network significantly, thus saving valuable computational time. Due to insufficient time, we did not actually

Abstract A POPL Pearl Submission Clowns to the Left of me, Jokers to the Right

by Joe Egan, Gerry Rafferty
"... This paper, submitted as a ‘pearl’, introduces a small but useful generalisation to the ‘derivative ’ operation on datatypes underlying Huet’s notion of ‘zipper ’ (Huet 1997; McBride 2001; Abbott et al. 2005b), giving a concrete representation to one-hole contexts in data which is in mid-transformat ..."
Abstract - Add to MetaCart
This paper, submitted as a ‘pearl’, introduces a small but useful generalisation to the ‘derivative ’ operation on datatypes underlying Huet’s notion of ‘zipper ’ (Huet 1997; McBride 2001; Abbott et al. 2005b), giving a concrete representation to one-hole contexts in data which is in mid

Minimalist proteins: Design of new molecular recognition scaffolds*

by Jumi A. Shin
"... Abstract: We hypothesize that we can exploit what Nature has already evolved by manipu-lating the α-helix molecular recognition scaffold. Therefore, minimalist proteins capable of sequence-specific, high-affinity binding of DNA were generated to probe how proteins are used and can be used to recogni ..."
Abstract - Add to MetaCart
to recognize DNA. The already minimal basic region/leucine zipper motif (bZIP) of GCN4 was reduced to an even more simplified structure by substitution with alanine residues—hence, a generic, Ala-based, helical scaffold. The proteins generated, wt bZIP, 4A, 11A, and 18A, contain 0, 4, 11, and 18 alanine
Results 11 - 17 of 17