Relevant bibliographies by topics / Functional types

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Functional types'

Author: Grafiati
Published: 4 June 2021
Last updated: 1 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Functional types.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Functional types"

1

Gillison, Andrew N. "Circumboreal Gradients in Plant Species and Functional Types." Botanica Pacifica 01, no. 1 (September 10, 2012): 97–107. http://dx.doi.org/10.17581/bp.2012.01105.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Yang, Yanzheng, Qiuan Zhu, Changhui Peng, Han Wang, and Huai Chen. "From plant functional types to plant functional traits." Progress in Physical Geography: Earth and Environment 39, no. 4 (May 7, 2015): 514–35. http://dx.doi.org/10.1177/0309133315582018.

Full text
Abstract:
Dynamic global vegetation models (DGVMs) typically track the material and energy cycles in ecosystems with finite plant functional types (PFTs). Increasingly, the community ecology and modelling studies recognize that current PFT scheme is not sufficient for simulating ecological processes. Recent advances in the study of plant functional traits (FTs) in community ecology provide a novel and feasible approach for the improvement of PFT-based DGVMs. This paper reviews the development of current DGVMs over recent decades. After characterizing the advantages and disadvantages of the PFT-based scheme, it summarizes trait-based theories and discusses the possibility of incorporating FTs into DGVMs. More importantly, this paper summarizes three strategies for constructing next-generation DGVMs with FTs. Finally, the method’s limitations, current challenges and future research directions for FT theory are discussed for FT theory. We strongly recommend the inclusion of several FTs, namely specific leaf area (SLA), leaf nitrogen content (LNC), carbon isotope composition of leaves (Leaf δ13C), the ratio between leaf-internal and ambient mole fractions of CO2 (Leaf Ci/Ca), seed mass and plant height. These are identified as the most important in constructing DGVMs based on FTs, which are also recognized as important ecological strategies for plants. The integration of FTs into dynamic vegetation models is a critical step towards improving the results of DGVM simulations; communication and cooperation among ecologists and modellers is equally important for the development of the next generation of DGVMs.
APA, Harvard, Vancouver, ISO, and other styles
3

Hill, Mark O., T. M. Smith, H. H. Shugart, and F. I. Woodward. "Functional Types for Global Modelling." Global Ecology and Biogeography Letters 7, no. 4 (July 1998): 312. http://dx.doi.org/10.2307/2997613.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

DANVY, OLIVIER. "Functional unparsing." Journal of Functional Programming 8, no. 6 (November 1998): 621–25. http://dx.doi.org/10.1017/s0956796898003104.

Full text
Abstract:
A string-formatting function such as printf in C seemingly requires dependent types, because its control string determines the rest of its arguments. Examples:formula hereWe show how changing the representation of the control string makes it possible to program printf in ML (which does not allow dependent types). The result is well typed and perceptibly more efficient than the corresponding library functions in Standard ML of New Jersey and in Caml.
APA, Harvard, Vancouver, ISO, and other styles
5

Sharpee, Tatyana O. "Toward Functional Classification of Neuronal Types." Neuron 83, no. 6 (September 2014): 1329–34. http://dx.doi.org/10.1016/j.neuron.2014.08.040.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Wilson, J. Bastow. "Guilds, Functional Types and Ecological Groups." Oikos 86, no. 3 (September 1999): 507. http://dx.doi.org/10.2307/3546655.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Nair, Anitha, Shubha Sathyendranath, Trevor Platt, Jesus Morales, Venetia Stuart, Marie-Hélène Forget, Emmanuel Devred, and Heather Bouman. "Remote sensing of phytoplankton functional types." Remote Sensing of Environment 112, no. 8 (August 2008): 3366–75. http://dx.doi.org/10.1016/j.rse.2008.01.021.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Ustin, Susan L., and John A. Gamon. "Remote sensing of plant functional types." New Phytologist 186, no. 4 (May 10, 2010): 795–816. http://dx.doi.org/10.1111/j.1469-8137.2010.03284.x.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Kaufman, Roger, and L. Warren Harrell. "Types of Functional Educational Planning Modes." Performance Improvement Quarterly 2, no. 1 (October 22, 2008): 4–13. http://dx.doi.org/10.1111/j.1937-8327.1989.tb00389.x.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Santander, González, Martínez Cuadrado, Toledo Lobo, and Martinez Alonso. "Communicating Synapses: Types and Functional Interpretation." Cells Tissues Organs 142, no. 3 (1991): 249–60. http://dx.doi.org/10.1159/000147198.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Functional types"

1

Petrucciani, Tommaso. "Polymorphic set-theoretic types for functional languages." Thesis, Sorbonne Paris Cité, 2019. http://www.theses.fr/2019USPCC067.

Full text
Abstract:
Cette thèse porte sur l'étude des types ensemblistes : des types qui contiennent des connecteurs d'union, d'intersection et de négation. Les types ensemblistes permettent de typer de manière très précise plusieurs constructions des langages de programmation (comme par exemple les branches conditionnelles, le filtrage par motif et la surcharge des fonctions) lorsqu'ils sont utilisés avec une notion appropriée de sous-typage. Pour définir celle-ci, nous utilisons l'approche du sous-typage sémantique, dans laquelle les types sont interprétés comme des ensembles, et où le sous-typage est défini comme l'inclusion ensembliste. Dans la plupart de cette thèse, les types ensemblistes sont polymorphes, dans le sens où ils contiennent des variables de type pour permettre le polymorphisme paramétrique.La thèse étend les travaux précédents sur les types ensemblistes et le sous-typage sémantique en montrant comment les adapter à de nouveaux contextes et comment les utiliser pour typer plusieurs aspects des langages fonctionnels. Elle se compose de trois parties.La première partie porte sur une étude des langages typés de manière implicite avec polymorphisme du "let" et inférence de types (contrairement aux travaux précédents sur le sous-typage sémantique qui étudiaient des langages typés explicitement). Nous y décrivons un lambda-calcul typé implicitement avec un système de types dont nous démontrons la correction. De même, nous y étudions l'inférence de types dont nous démontrons la correction et la complétude. Enfin, nous montrons comment rendre l'inférence plus précise quand les programmes sont partiellement annotés avec des types.La deuxième partie décrit une nouvelle approche permettant d'étendre un système de types statique avec du typage graduel; l'originalité venant du fait que nous décrivons le système de types de façon déclarative, lorsque les systèmes existants proposent des descriptions algorithmiques. Nous illustrons cette approche en ajoutant le typage graduel à un système de types à la Hindley-Milner sans sous-typage. Nous décrivons pour cela un système de types déclaratif, un processus de compilation vers un langage avec vérifications de type dynamiques (ou "casts"), et nous présentons un système d'inférence de types correct et complet. Ensuite, nous y ajoutons les types ensemblistes, en définissant une relation de sous-typage sur les types graduel ensemblistes, puis en présentant un système d'inférence de types correct pour le système étendu.La troisième partie porte sur l'étude des sémantiques non-strictes. Les systèmes existants qui utilisent le sous-typage sémantique ont été développés pour des langages avec appel par valeur et ne sont pas sûrs pour des sémantiques non-strictes. Nous montrons ici comment les adapter pour garantir leur sûreté en appel par nécessité. Pour faire ça, nous introduisons dans les types une représentation explicite de la divergence, afin que le système des types puisse distinguer les expressions qui ne demandent pas d'évaluation de celles qui la demandent et pourraient ainsi diverger
We study set-theoretic types: types that include union, intersection, and negation connectives. Set-theoretic types, coupled with a suitable subtyping relation, are useful to type several programming language constructs – including conditional branching, pattern matching, and function overloading – very precisely. We define subtyping following the semantic subtyping approach, which interprets types as sets and defines subtyping as set inclusion. Our set-theoretic types are polymorphic, that is, they contain type variables to allow parametric polymorphism.We extend previous work on set-theoretic types and semantic subtyping by showing how to adapt them to new settings and apply them to type various features of functional languages. More precisely, we integrate semantic subtyping with three important language features.In Part I we study implicitly typed languages with let-polymorphism and type inference (previous work on semantic subtyping focused on explicitly typed languages). We describe an implicitly typed lambda-calculus and a declarative type system for which we prove soundness. We study type inference and prove results of soundness and completeness. Then, we show how to make type inference more precise when programs are partially annotated with types.In Part II we study gradual typing. We describe a new approach to add gradual typing to a static type system; the novelty is that we give a declarative presentation of the type system, while previous work considered algorithmic presentations. We first illustrate the approach on a Hindley-Milner type system without subtyping. We describe declarative typing, compilation to a cast language, and sound and complete type inference. Then, we add set-theoretic types, defining a subtyping relation on set-theoretic gradual types, and we describe sound type inference for the extended system.In Part III we consider non-strict semantics. The existing semantic subtyping systems are designed for call-by-value languages and are unsound for non-strict semantics. We adapt them to obtain soundness for call-by-need. To do so, we introduce an explicit representation for divergence in the types, allowing the type system to distinguish the expressions that are already evaluated from those that are computations which might diverge
APA, Harvard, Vancouver, ISO, and other styles
2

Grimley, Allan. "Inductive types in functional programming." Thesis, University of Kent, 1990. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.253737.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Wisnesky, Ryan. "Functional Query Languages with Categorical Types." Thesis, Harvard University, 2013. http://dissertations.umi.com/gsas.harvard:11288.

Full text
Abstract:
We study three category-theoretic types in the context of functional query languages (typed lambda-calculi extended with additional operations for bulk data processing). The types we study are:
Engineering and Applied Sciences
APA, Harvard, Vancouver, ISO, and other styles
4

Aston, Tim. "CO₂ responsiveness of different plant functional types." Bachelor's thesis, University of Cape Town, 2003. http://hdl.handle.net/11427/24399.

Full text
Abstract:
Atmospheric CO₂ levels have increased by 30 % since the onset of the industrial revolution and are likely to continue to rise in the future. Whilst growth of plants is typically enhanced under elevated CO₂ concentrations, the degree of the response varies from species. In this study 4 species were exposed to 6 different CO₂ levels across a range from sub ambient to super ambient conceliltrations.
APA, Harvard, Vancouver, ISO, and other styles
5

Pavaux, Alice. "Inductive, Functional and Non-Linear Types in Ludics." Thesis, Sorbonne Paris Cité, 2017. http://www.theses.fr/2017USPCD092.

Full text
Abstract:
Cette thèse est consacrée à une exploration des types de la ludique. S’inscrivant dans un contexte marqué par la correspondance de Curry–Howard, la ludique est un cadre permettant d’étudier l’aspect dynamique de la logique et de la programmation. Les objets de base, appelés desseins, sont des preuves infinitaires non-typées qui peuvent également être vues comme des stratégies sous l’angle de la sémantique des jeux, et un type ou comportement est un ensemble de desseins se conduisant de la même manière du point de vue de l’interaction. On s’intéresse aux propriétés interactives des comportements. Notre attention se porte en particulier sur les comportements représentant les types de données et de fonctions, et sur les comportements non-linéaires qui permettent la duplication d’objets. Un nouveau résultat de complétude interne pour les unions infinies dévoile la structure des types de données inductifs. Grâce à une analyse des chemins visitables,c’est-à-dire des possibles traces d’exécution, on prouve que les comportements inductifs et fonctionnels sont réguliers, ouvrant la voie pour une caractérisation de MALL en ludique. On montre également qu’un comportement fonctionnel est pur, une propriété garantissant la sûreté du typage, si et seulement si ce n’est pas un type de fonctions prenant des fonctions en argument. Enfin, on pose les bases d’une étude précise de la non-linéarité en ludique en retrouvant une forme de complétude interne et en discutant des chemins visitables
This thesis investigates the types of ludics. Within the context of the Curry–Howard correspondence,l udics is a framework in which the dynamic aspects of both logic and programming can be studied. The basic objects, called designs, are untyped infinitary proofs that can also beseen as strategies from the perspective of game semantics, and a type or behaviour is a set of designs well-behaved with respect to interaction. We are interested in observing the interactive properties of behaviours. Our attention is particularly focused on behaviours representing the types of data and functions, and on non-linear behaviours which allow the duplication of objects. A new internal completeness result for infinite unions unveils the structure of inductive data types. Thanks to an analysis of the visitable paths, i.e., the possible execution traces, we prove that inductive and functional behaviours are regular, paving the way for a characterisation of MALL in ludics. We also show that a functional behaviour is pure, a property ensuring the safety of typing, if and only if it is not a type of functions taking functions as argument. Finally,we set the bases for a precise study of non-linearity in ludics by recovering a form of internal completeness and discussing the visitable paths
APA, Harvard, Vancouver, ISO, and other styles
6

Almeida, Neves Sampayo Ramos Ricardo. "New types of functional nanocarriers by nano precipitation." Thesis, Lyon, 2020. http://www.theses.fr/2020LYSEI091.

Full text
Abstract:
La technique de nanoprécipitation est une méthode simple et reproductible pour la synthèse de nanocapsules à coeur huileux recouvertes d’une enveloppe de polymères hydrophiles réticulés (polysaccharides, glycopolymères vinyliques…) en une seule étape. Grâce à leur biocompatibilité, leur biodégradabilité et leur activité biologique adaptables, les protéines constituent une autre grande famille de biopolymères d’intérêt pour des applications dans le domaine de l’encapsulation. Cependant, la production de nanocapsules protéiques par nanoprécipitation n’a jamais été décrite. Dans ce contexte, l’objectif principal de ce travail de thèse a été l’évaluation du potentiel d’une famille de protéines, les Suckerines, pour le procédé de nanoprécipitation. Les Suckerines sont une famille de protéines issues des dents décorant les ventouses du calamar géant Humboldt avec de prometteuses applications dans le domaine biomédical. Ces protéines possèdent une structure modulaire de type copolymère à bloc capable de former des feuillets bêta conférant de bonnes propriétés mécaniques. Les suckerines étant solubles dans une solution tampon composée d’acide acétique (pH 3) mais fortement agrégées dans les conditions de pH (valeurs comprises entre 5 et 10) classiquement utilisées pour la préparation de nanocapsules à coeur huileux par basculement de solvant, nous avons finalement choisi d’explorer la nanoprécipitation des protéines par salt shifting et donc la préparation de nanoparticules protéiques. L’utilisation du persulfate d’ammonium comme agent de coacervation et précurseur de radicaux et du tris(2,2′ bipyridyl)dichlororuthenium(II) hexahydrate a permis de produire des nanoparticules de suckerine de tailles modulables (100-185 nm de diamètre). Ces nanoparticules présentent des structures secondaires type feuillets bêta qui sont à l’origine du module de Young très élevé observé pour ces nano-objets (de l’ordre de grandeur du GPa). Une protéine de fusion, soluble en milieu aqueux à pH 7 a spécialement été conçue par voie de recombinaison dans le but de générer des nanocapsules protéiques par nanoprécipitation. Cette protéine (suckerine-soie) est formée d’un bloc central de peptide dérivé de suckerine de calamar promouvant une stabilité structurelle et deux blocs terminaux issus de fibroïnes de soie qui permettent à la protéine de fusion d’être soluble à un pH physiologique. Ce design moléculaire a permis la fabrication de nanocapsules remplies respectivement de hexadécane ou de miglyol avec une enveloppe de suckerine-soie et de tailles de l’ordre de grandeur de 190 à 250 nm. Finalement, aspirant à encapsuler un principe actif anti-cancéreux dans les nanocapsules à base de glycogène, nous avons développé un protocole où la méthode de nanoprécipitation est utilisée pour produire des nanoparticules de prodrogue entourés de glycogène
The nanoprecipitation technique is a reliable route to synthesize oil filled nanocapsules with shells made of hydrophilic polymers such as polysaccharides and vinyl based glycopolymers in a one pot procedure. Thanks to their biocompatibility, biodegradability and tunable biological activity, proteins are another promising class of materials for encapsulation purposes. However, the generation of proteinaceous nanocapsules by nanoprecipitation has never been reported. In this context, the main objective of this PhD was to evaluate the potential of a family of proteins, the Suckerins, in nanoprecipitation processes. Suckerins are a family of proteins found in the sucker ring teeth of the giant Humboltd squid with promising biomedical applications. These proteins possess a modular, block copolymer like structure capable of forming β-sheets responsible for good mechanical properties. The suckerin proteins are not soluble at a pH range between 5 and 10, a requirement of the nanoprecipitation technique. However, they can be solubilized using aqueous buffers at pH 3 containing acetic acid. Other ways of precipitating the protein were explored in this manuscript with salt shifting using ammonium persulphate as coacervation agents being capable of generating 100 nm nanoparticles. These nanoparticles presented the β sheet secondary structure which resulted in Young modulus in the GPa range. A fusion protein that could be solubilized in aqueous solutions at pH 7, and therefore be used in the nanoprecipitration process, was recombinantly produced. The protein (suckerin silk) is formed by a central squid suckerin-derived peptide block that provides structural stability and both termini from silk fibroins that make the modular protein highly soluble at physiological pH. This molecular design allowed the fabrication of hexadecane and miglyol filled nanocapsules with suckerin silk shells and sizes in the range 190 – 250 nm. Finally, aiming to encapsulate an anti cancer drug in glycogen nanocapsules we developed a protocol where the nanoprecipitation process is used to generate glycogen coated prodrug nanoparticles
APA, Harvard, Vancouver, ISO, and other styles
7

Vasconcelos, Pedro Baltazar. "Space cost analysis using sized types /." St Andrews, 2008. http://hdl.handle.net/10023/564.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Wilson, Sean. "Supporting dependently typed functional programming with proof automation and testing." Thesis, University of Edinburgh, 2011. http://hdl.handle.net/1842/5277.

Full text
Abstract:
Dependent types can be used to capture useful properties about programs at compile time. However, developing dependently typed programs can be difficult in current systems. Capturing interesting program properties usually requires the user to write proofs, where constructing the latter can be both a difficult and tedious process. Additionally, finding and fixing errors in program scripts can be challenging. This thesis concerns ways in which functional programming with dependent types can be made easier. In particular, we focus on providing help for developing programs that incorporate user-defined types and user-defined functions. For the purpose of supporting dependently typed programming, we have designed a framework that provides improved proof automation and error feedback. Proof automation is provided with the use of heuristic based tactics that automate common patterns of proofs that arise when programming with dependent types. In particular, we use heuristics for generalising goals and employ the rippling heuristic for guiding inductive and non-inductive proofs. The automation we describe includes features for caching and reusing lemmas proven during proof search and, whenever proof search fails, the user can assist the prover by providing high-level hints. We concentrate on providing improved feedback for the errors that occur when there is a mismatch between the specification of a program, described with the use of dependent types, and the behaviour of the program. We employ a QuickCheck-like testing tool for automatically identifying these forms of errors, where the counter examples generated are used as error messages. To demonstrate the effectiveness of our framework for supporting dependently typed programming, we have developed a prototype based around the Coq theorem prover. We demonstrate that the framework as a whole makes program development easier by conducting a series of case studies. In these case studies, which involved verifying properties of tail recursive functions, sorting functions and a binary adder, a significant number of the proofs required were automated.
APA, Harvard, Vancouver, ISO, and other styles
9

Delgado, Diana. "Subsitution of stimulus functions as a means to distinguish among different types of functional classes /." abstract and full text PDF (free order & download UNR users only), 2005. http://0-wwwlib.umi.com.innopac.library.unr.edu/dissertations/fullcit/1430443.

Full text
Abstract:
Thesis (M.A.)--University of Nevada, Reno, 2005.
"May, 2005." Includes bibliographical references (leaves 47-49). Online version available on the World Wide Web. Library also has microfilm. Ann Arbor, Mich. : ProQuest Information and Learning Company, [2005]. 1 microfilm reel ; 35 mm.
APA, Harvard, Vancouver, ISO, and other styles
10

Vasconcelos, Pedro B. "Space cost analysis using sized types." Thesis, University of St Andrews, 2008. http://hdl.handle.net/10023/564.

Full text
Abstract:
Programming resource-sensitive systems, such as real-time embedded systems, requires guaranteeing both the functional correctness of computations and also that time and space usage fits within constraints imposed by hardware limits or the environment. Functional programming languages have proved very good at meeting the former logical kind of guarantees but not the latter resource guarantees. This thesis contributes to demonstrate the applicability of functional programming in resource-sensitive systems with an automatic program analysis for obtaining guaranteed upper bounds on dynamic space usage of functional programs. Our analysis is developed for a core subset of Hume, a domain-specific functional language targeting resource-sensitive systems (Hammond et al. 2007), and presented as a type and effect system that builds on previous sized type systems (Hughes et al. 1996, Chin and Khoo 2001) and effect systems for costs (Dornic et al. 1992, Reistad and Giord 1994, Hughes and Pareto 1999). It extends previous approaches by using abstract interpretation techniques to automatically infer linear approximations of the sizes of recursive data types and the stack and heap costs of recursive functions. The correctness of the analysis is formally proved with respect to an operational semantics for the language and an inference algorithm that automatically reconstructs size and cost bounds is presented. A prototype implementation of the analysis and operational semantics has been constructed and used to experimentally assess the quality of the cost bounds with some examples, including implementations of textbook functional programming algorithms and simplified embedded systems.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Functional types"

1

Games and full abstraction for a functional metalanguage with recursive types. Berlin: Springer, 1998.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Greller, Andrew M., Kazue Fujiwara, and Franco Pedrotti, eds. Geographical Changes in Vegetation and Plant Functional Types. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-68738-4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

McCusker, Guy. Games and Full Abstraction for a Functional Metalanguage with Recursive Types. London: Springer London, 1998. http://dx.doi.org/10.1007/978-1-4471-0615-9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Heemskerk, Ben. Ecosystem and tree attributes affecting the presence of functional wildlife tree types. Victoria: British Columbia Ministry of Forests and Range, Forest Science Program, 2009.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Heemskerk, Ben. Ecosystem and tree attributes affecting the presence of functional wildlife tree types. Victoria: British Columbia Ministry of Forests and Range, Forest Science Program, 2009.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Office, General Accounting. Functional regulation: An analysis of two types of pooled investment funds : report to members of Congress. Washington, D.C: The Office, 1986.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Nanigopal, Mandal, ed. Integral expansions related to Mehler-Fock type transforms: Some new types of integral transforms involving spherical harmonics. Harlow: Longman, 1997.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Pierce, Benjamin C. Statically typed friendly functions via partially abstract types. Edinburgh: LFCS, Dept. of Computer Science, University of Edinburgh, 1993.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Karl-Joachim, Wirths, ed. Schwarz-pick type inequalities. Basel: Birkhäuser, 2009.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Thompson, Simon. Type theory and functional programming. Wokingham, England: Addison-Wesley, 1991.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Functional types"

1

Pavelka, Margit, and Jürgen Roth. "Secretory Granule Types." In Functional Ultrastructure, 88–89. Vienna: Springer Vienna, 2010. http://dx.doi.org/10.1007/978-3-211-99390-3_46.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Smith, T. M., H. H. Shugart, F. I. Woodward, and P. J. Burton. "Plant Functional Types." In Vegetation Dynamics & Global Change, 272–92. Boston, MA: Springer US, 1993. http://dx.doi.org/10.1007/978-1-4615-2816-6_14.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Pil, Marco. "Dynamic Types and Type Dependent Functions." In Implementation of Functional Languages, 169–85. Berlin, Heidelberg: Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/3-540-48515-5_11.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Pavelka, Margit, and Jürgen Roth. "Mitochondria: Crista and Tubulus Types." In Functional Ultrastructure, 128–29. Vienna: Springer Vienna, 2010. http://dx.doi.org/10.1007/978-3-211-99390-3_67.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Kiselyov, Oleg, and Keigo Imai. "Session Types Without Sophistry." In Functional and Logic Programming, 66–87. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-59025-3_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Agat, Johan. "Types for register allocation." In Implementation of Functional Languages, 92–111. Berlin, Heidelberg: Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/bfb0055426.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Beierle, Christoph, and Gregor Meyer. "Using Types as Approximations for Type Checking Prolog Programs." In Functional and Logic Programming, 251–66. Berlin, Heidelberg: Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/10705424_17.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Augustsson, Lennart. "Cayenne — A Language with Dependent Types." In Advanced Functional Programming, 240–67. Berlin, Heidelberg: Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/10704973_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

McBride, Conor. "Epigram: Practical Programming with Dependent Types." In Advanced Functional Programming, 130–70. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11546382_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Chung, Lawrence, Brian A. Nixon, Eric Yu, and John Mylopoulos. "Types of NFRs." In Non-Functional Requirements in Software Engineering, 153–60. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/978-1-4615-5269-7_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Functional types"

1

Jeffrey, Alan. "Functional reactive types." In CSL-LICS '14: JOINT MEETING OF the Twenty-Third EACSL Annual Conference on COMPUTER SCIENCE LOGIC. New York, NY, USA: ACM, 2014. http://dx.doi.org/10.1145/2603088.2603106.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

López Juan, Víctor, and Nils Anders Danielsson. "Practical dependent type checking using twin types." In ICFP '20: ACM SIGPLAN International Conference on Functional Programming. New York, NY, USA: ACM, 2020. http://dx.doi.org/10.1145/3406089.3409030.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Thibodeau, David, Andrew Cave, and Brigitte Pientka. "Indexed codata types." In ICFP'16: ACM SIGPLAN International Conference on Functional Programming. New York, NY, USA: ACM, 2016. http://dx.doi.org/10.1145/2951913.2951929.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Oliveira, Bruno C. d. S., Zhiyuan Shi, and João Alpuim. "Disjoint intersection types." In ICFP'16: ACM SIGPLAN International Conference on Functional Programming. New York, NY, USA: ACM, 2016. http://dx.doi.org/10.1145/2951913.2951945.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Weirich, Stephanie. "Depending on types." In ICFP'14: ACM SIGPLAN International Conference on Functional Programming. New York, NY, USA: ACM, 2014. http://dx.doi.org/10.1145/2628136.2631168.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Vazou, Niki, Alexander Bakst, and Ranjit Jhala. "Bounded refinement types." In ICFP'15: 20th ACM SIGPLAN International Conference on Functional Programming. New York, NY, USA: ACM, 2015. http://dx.doi.org/10.1145/2784731.2784745.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Zhu, He, Aditya V. Nori, and Suresh Jagannathan. "Learning refinement types." In ICFP'15: 20th ACM SIGPLAN International Conference on Functional Programming. New York, NY, USA: ACM, 2015. http://dx.doi.org/10.1145/2784731.2784766.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Thiemann, Peter, and Vasco T. Vasconcelos. "Context-free session types." In ICFP'16: ACM SIGPLAN International Conference on Functional Programming. New York, NY, USA: ACM, 2016. http://dx.doi.org/10.1145/2951913.2951926.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Vazou, Niki, Eric L. Seidel, Ranjit Jhala, Dimitrios Vytiniotis, and Simon Peyton-Jones. "Refinement types for Haskell." In ICFP'14: ACM SIGPLAN International Conference on Functional Programming. New York, NY, USA: ACM, 2014. http://dx.doi.org/10.1145/2628136.2628161.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Klapka, Pavel, Marián Halás, and Petr Tonev. "Functional regions: concept and types." In 16. mezinárodní kolokvium o regionálních vědách. Sborník příspěvků. (16th International Colloquium on Regional Sciences. Conference Proceedings.). Masaryk University Press, 2013. http://dx.doi.org/10.5817/cz.muni.p210-6257-2013-11.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Functional types"

1

Hines, William C., and Jeffrey K. Griffith. Identification of the Types, Properties, and Functional Characteristics of Telomerase Expressing Cells in Breast Cancer. Fort Belvoir, VA: Defense Technical Information Center, May 2004. http://dx.doi.org/10.21236/ada435507.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Hines, William C., and Jeffrey K. Griffith. Identification of the Types Properties and Functional Characteristics of Telomerase Expressing Cells in Breast Cancer. Fort Belvoir, VA: Defense Technical Information Center, May 2003. http://dx.doi.org/10.21236/ada423991.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Boudreau, Bernard P. Inclusion of Multiple Functional Types in an Automaton Model of Bioturbation and their Effects on Sediments Properties. Fort Belvoir, VA: Defense Technical Information Center, January 2006. http://dx.doi.org/10.21236/ada522314.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Boudreau, Bernard P. Inclusion of Multiple Functional Types in an Automaton Model of Bioturbation and Their Effects on Sediments Properties. Fort Belvoir, VA: Defense Technical Information Center, September 2007. http://dx.doi.org/10.21236/ada570926.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Ahn, Ki Yung. The Nax Language: Unifying Functional Programming and Logical Reasoning in a Language based on Mendler-style Recursion Schemes and Term-indexed Types. Portland State University Library, January 2000. http://dx.doi.org/10.15760/etd.2086.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Hedquist, K. A. ,. Fluor Daniel Hanford. Functional design criteria for WESF type-W CsCl capsule overpack. Office of Scientific and Technical Information (OSTI), February 1997. http://dx.doi.org/10.2172/325843.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Bekar, Kerim. Hermite–Hadamard Type Inequalities for Trigonometrically P‑functions. "Prof. Marin Drinov" Publishing House of Bulgarian Academy of Sciences, December 2019. http://dx.doi.org/10.7546/crabs.2019.11.01.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Reich, Peter. Global land model development: time to shift from a plant functional type to a plant functional trait approach (Final Report). Office of Scientific and Technical Information (OSTI), August 2018. http://dx.doi.org/10.2172/1512943.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Furey, William, Martin Sax, and S. Swaminathan. X-Ray Crystallography of Botulinum Neurotoxin Type E and Its Functional Subunits. Fort Belvoir, VA: Defense Technical Information Center, December 2002. http://dx.doi.org/10.21236/ada413858.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Matsutani, Shigeki, and Jiryo Komeda. Sigma Functions for a Space Curve of Type (3,4,5). Journal of Geometry and Symmetry in Physics, 2013. http://dx.doi.org/10.7546/jgsp-30-2013-75-91.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Functional types' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography