Relevant bibliographies by topics / Y Combinator

Contents

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

Academic literature on the topic 'Y Combinator'

Author: Grafiati
Published: 4 June 2021
Last updated: 31 January 2023

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 'Y Combinator.'

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 "Y Combinator"

1

Legrand, Remi. "A basis result in combinatory logic." Journal of Symbolic Logic 53, no. 4 (1988): 1224–26. http://dx.doi.org/10.1017/s0022481200028048.

Full text
Abstract:
The aim of this article is to show that a basis for combinatory logic [2] must contain at least one combinator with rank strictly greater than two. We use notation of [1].Let Q be a primitive combinator given by its reduction rule Qx1 … xn → C, where C is a pure combination of the variables x1,…, xn. n is called the rank of the combinator.A set {Q1,…,Qn} of combinators is a basis for combinatory logic if for every finite set {x1,…,xm} of variables and every pure combination C of these variables, there exists a pure combinator Q of Q1,…,Qn such that Qx1…xm↠C.Property. The Church-Rosser theorem
APA, Harvard, Vancouver, ISO, and other styles
2

Bimbó, Katalin. "The Church-Rosser property in symmetric combinatory logic." Journal of Symbolic Logic 70, no. 2 (2005): 536–56. http://dx.doi.org/10.2178/jsl/1120224727.

Full text
Abstract:
AbstractSymmetic combinatory logic with the symmetric analogue of a combinatorially complete base (in the form of symmetric λ-calculus) is known to lack the Church-Rosser property. We prove a much stronger theorem that no symmetric combinatory logic that contains at least two proper symmetric combinatory has the Church-Rosser property. Although the statement of the result looks similar to an earlier one concerning dual combinatory logic, the proof is different because symmetric combinators may form redexes in both left and right associated terms. Perhaps surprisingly, we are also able to show
APA, Harvard, Vancouver, ISO, and other styles
3

Bimbó, Katalin. "The Church-Rosser property in dual combinatory logic." Journal of Symbolic Logic 68, no. 1 (2003): 132–52. http://dx.doi.org/10.2178/jsl/1045861508.

Full text
Abstract:
AbstractDual combinators emerge from the aim of assigning formulas containing ← as types to combinators. This paper investigates formally some of the properties of combinatory systems that include both combinators and dual combinators. Although the addition of dual combinators to a combinatory system does not affect the unique decomposition of terms, it turns out that some terms might be redexes in two ways (with a combinator as its head, and with a dual combinator as its head). We prove a general theorem stating that no dual combinatory system possesses the Church-Rosser property. Although th
APA, Harvard, Vancouver, ISO, and other styles
4

Goble, Lou. "Combinator Logics." Studia Logica 76, no. 1 (2004): 17–66. http://dx.doi.org/10.1023/b:stud.0000027466.68014.52.

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

Jay, Barry, and Thomas Given-Wilson. "A combinatory account of internal structure." Journal of Symbolic Logic 76, no. 3 (2011): 807–26. http://dx.doi.org/10.2178/jsl/1309952521.

Full text
Abstract:
AbstractTraditional 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, because they access internal structure in ways that S and K cannot. Much of this expressive power is captured by adding a factorisation combinator F. The resulting SF-calculus is structure complete, in that it supports all pattern-matching functions whose patterns are in normal form, including a function that decides structural equality of arbitrary normal forms. A g
APA, Harvard, Vancouver, ISO, and other styles
6

OKASAKI, CHRIS. "THEORETICAL PEARLS." Journal of Functional Programming 13, no. 4 (2003): 815–22. http://dx.doi.org/10.1017/s0956796802004483.

Full text
Abstract:
A combinator expression is flat if it can be written without parentheses, that is, if all applications nest to the left, never to the right. This note explores a simple method for flattening combinator expressions involving arbitrary combinators.
APA, Harvard, Vancouver, ISO, and other styles
7

Joy, M. S., V. J. Rayward-Smith, and F. W. Burton. "Efficient combinator code." Computer Languages 10, no. 3-4 (1985): 211–24. http://dx.doi.org/10.1016/0096-0551(85)90017-7.

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

Steedman, Mark. "The Lost Combinator." Computational Linguistics 44, no. 4 (2018): 613–29. http://dx.doi.org/10.1162/coli_a_00328.

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

Waldmann, Johannes. "The Combinator S." Information and Computation 159, no. 1-2 (2000): 2–21. http://dx.doi.org/10.1006/inco.2000.2874.

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

Parfitt, Eric James. "Patterns in Combinator Evolution." Complex Systems 26, no. 2 (2017): 119–34. http://dx.doi.org/10.25088/complexsystems.26.2.119.

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

Dissertations / Theses on the topic "Y Combinator"

1

Tunmer, Michael Luke. "Combinator reduction on networks of small processors." Thesis, University of Cambridge, 1990. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.358850.

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

Giannakopoulos, Theophilos John. "Multi-Decision Policy and Policy Combinator Specifications." Digital WPI, 2012. https://digitalcommons.wpi.edu/etd-theses/166.

Full text
Abstract:
Margrave is a specification language and analysis tool for access control policies with semantics based in order-sorted logic. The clear logical roots of Margrave's semantics makes policies specified in the Margrave language both machine analyzable and relatively easy for users to reason about. However, the decision conflict resolution declaration and policy set features of Margrave do not have semantics that are as cleanly rooted in order-sorted logic as Margrave policies and queries are. Additionally, the current semantics of decision conflict resolution declarations and of policy sets do
APA, Harvard, Vancouver, ISO, and other styles
3

Lester, David. "Combinator graph reduction : A congruence and its applications." Thesis, University of Oxford, 1988. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.236057.

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

Nipoti, Vladimir. "Podnikatelské akcelerátory. Význam a přínosy." Master's thesis, Vysoká škola ekonomická v Praze, 2014. http://www.nusl.cz/ntk/nusl-193365.

Full text
Abstract:
The aim of this thesis is to analyse and compare the contributions of business or startup accelerators. The contributions are compared from the point of view of the managers of accelerators, startups and investors. Business accelerators help new firms accelerate their growth. The aid can be provided in a material form through financial capital and services or in an educational form through workshops and mentoring. The first chapter deals with the definition of the accelerator, its history and differences with incubators. The second chapter engages in the causes of the phenomenon of startups an
APA, Harvard, Vancouver, ISO, and other styles
5

Bucciarelli, Stefano. "Un compilatore per un linguaggio per smart contract intrinsecamente tipato." Bachelor's thesis, Alma Mater Studiorum - Università di Bologna, 2019. http://amslaurea.unibo.it/19573/.

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

Despré, Vincent. "Topologie et algorithmes sur les cartes combinatoires." Thesis, Université Grenoble Alpes (ComUE), 2016. http://www.theses.fr/2016GREAM043/document.

Full text
Abstract:
Dans cette thèse, nous nous intéressons aux propriétés topologiques des surfaces, i.e. celles qui sont préservées par des déformations continues. Intuitivement, ces propriétés peuvent être imaginées comme étant celles qui décrivent le forme générale des surfaces. Nous utilisons des cartes combinatoires pour décrire les surfaces. Elles ont le double avantage d'être de naturels objets mathématiques et de pouvoir être transformées naturellement en structure de données.Nous étudions trois problèmes différents. Premièrement, nous donnons des algorithmes pour calculer le nombre géométrique d'interse
APA, Harvard, Vancouver, ISO, and other styles
7

Priez, Jean-Baptiste. "Combinatoire des fonctions de parking : espèces, énumération d’automates et algèbres de Hopf." Thesis, Université Paris-Saclay (ComUE), 2015. http://www.theses.fr/2015SACLS111/document.

Full text
Abstract:
Cette thèse se situe dans les domaines de la combinatoire algébrique, bijective et énumérative.Elle s'intéresse à l'étude des fonctions de parking généralisées suivant ces trois axes.medskip. Dans une première partie, on s'intéresse aux fonctions de parking généralisées en tant qu'espèce de structures combinatoires (théorie introduite par A.nom{Joyal} et développée F. nom{Bergeron}, G. nom{Labelle} et P.nom{Leroux}). On définit cette espèce à partir d'une équation fonctionnelle faisant intervenir l'espèce des séquences d'ensembles.On obtient un relèvement non-commutatif de la série indicatrice
APA, Harvard, Vancouver, ISO, and other styles
8

Campitelli, Eduardo Moreti [UNESP]. "Análises e estudos para alocação e ajustes de dispositivos de proteção em redes de média tensão de energia elétrica com geração distribuída." Universidade Estadual Paulista (UNESP), 2007. http://hdl.handle.net/11449/87232.

Full text
Abstract:
Made available in DSpace on 2014-06-11T19:22:35Z (GMT). No. of bitstreams: 0 Previous issue date: 2007-07-06Bitstream added on 2014-06-13T19:48:57Z : No. of bitstreams: 1 campitelli_em_me_ilha.pdf: 1263646 bytes, checksum: 8c37b7f4ddd0230d76c35d0ab31e2adf (MD5)<br>Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)<br>Devido a alta competitividade do mercado de energia junto com a redução dos custos de novas tecnologias que disponibilizam no mercado geradores de energia elétrica de diferentes modelos de variadas capacidades, a custos competitivos, atualmente há uma tendência
APA, Harvard, Vancouver, ISO, and other styles
9

Ro, Hee-Jin. "Les référentiels et opérateurs aspecto-temporels : définitions, formalisation logique et informatique." Thesis, Paris 4, 2012. http://www.theses.fr/2012PA040130.

Full text
Abstract:
Le présent travail prend appui sur une synthèse de travaux déjà effectués dans l’équipe LaLIC (Langues,Linguistiques, Informatique, Cognition) ; il insiste sur l’articulation entre différents concepts, centrés sur la notion deréférentiel. Ma thèse fait partie d’une chaîne où sont approfondis certains concepts rendus de plus en plus opératoires.Mon travail prend appui sur les travaux sur le temps et l’aspect d’E. Benveniste, A. Culioli et J.-P. Desclés, enparticulier, il s’inscrit le développement de la théorisation du temps et de l’aspect entreprise par J.-P. Desclés et Z.Guentchéva. Dans cett
APA, Harvard, Vancouver, ISO, and other styles
10

Campitelli, Eduardo Moreti. "Análises e estudos para alocação e ajustes de dispositivos de proteção em redes de média tensão de energia elétrica com geração distribuída /." Ilha Solteira : [s.n.], 2007. http://hdl.handle.net/11449/87232.

Full text
Abstract:
Orientador: José Roberto Sanches Mantovani<br>Banca: Antonio Padilha Feltrin<br>Banca: José Carlos de Melo Vieira Júnior<br>Resumo: Devido a alta competitividade do mercado de energia junto com a redução dos custos de novas tecnologias que disponibilizam no mercado geradores de energia elétrica de diferentes modelos de variadas capacidades, a custos competitivos, atualmente há uma tendência de utilização de novas fontes para geração de energia elétrica. Neste sentido, de acordo com análises técnicas e econômicas, a inserção de tais geradores pode ser adequada não somente ao longo de redes de t
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Y Combinator"

1

Koopman, Phil. An architecture for combinator graph reduction. Academic Press, 1990.

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

Koopman, Philip. An architecture for combinator graph reduction. Academic Press, 1990.

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

Hartel, Pieter H. Performance analysis of storage management in combinator graph reduction. University of Amsterdam, 1988.

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

Stevens, David. A generalization of Turner's combinator-based technique for implementing a functional language: Y David Stevens. University of Birmingham, 1997.

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

Stross, Randall E. The launch pad: Inside Silicon Valley's most exclusive school for startups. Portfolio/Penguin, 2012.

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

Munoz, Ignacio Bosque. Redes: Diccionario Combinatorio De Español Contemporaneo (Networks: Combination Dictionary Of Contemporary Spanish). Sm, 2007.

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

Canada. Dept. of the Secretary of State of Canada. and Canada. Translation Bureau. Terminology and Linguistic Services Directorate., eds. Vocabulaire combinatoire de la CFAO mécanique =: Combinatory vocabulary of CAD/CAM in mechanical engineering. Secrétariat d'État du Canada = Dept. of the Secretary of State of Canada, 1993.

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

Pogonowski, Jerzy. Combinatory semantics. Wydawn. Nauk. Uniwersytetu im. Adama Mickiewicza w Poznaniu, 1993.

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

Alladi, Krishnaswami, Peter Paule, James Sellers, and Ae Ja Yee, eds. Combinatory Analysis. Springer New York, 2013. http://dx.doi.org/10.1007/978-1-4614-7858-4.

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

Engeler, Erwin. The Combinatory Programme. Birkhäuser Boston, 1995.

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

Book chapters on the topic "Y Combinator"

1

Koopman, Pieter, and Rinus Plasmeijer. "Efficient Combinator Parsers." In Implementation of Functional Languages. Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/3-540-48515-5_8.

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

Fu, Yuxi. "Axiomatization Without Prefix Combinator." In Domains and Processes. Springer Netherlands, 2001. http://dx.doi.org/10.1007/978-94-010-0654-5_12.

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

Layka, Vishal, and David Pollak. "DSL and Parser Combinator." In Beginning Scala. Apress, 2015. http://dx.doi.org/10.1007/978-1-4842-0232-6_10.

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

Milner, R. "Parallel combinator reduction machine." In The Analysis of Concurrent Systems. Springer Berlin Heidelberg, 1985. http://dx.doi.org/10.1007/3-540-16047-7_41.

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

Waite, Martin, Bret Giddings, and Simon Lavington. "Parallel associative combinator evaluation." In PARLE '91 Parallel Architectures and Languages Europe. Springer Berlin Heidelberg, 1991. http://dx.doi.org/10.1007/3-540-54152-7_74.

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

Waite, Martin, Bret Giddings, and Simon Lavington. "Parallel Associative Combinator Evaluation." In Parle ’91 Parallel Architectures and Languages Europe. Springer Berlin Heidelberg, 1991. http://dx.doi.org/10.1007/978-3-662-25209-3_47.

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

Pollak, David, Vishal Layka, and Andres Sacco. "DSL and Parser Combinator." In Beginning Scala 3. Apress, 2022. http://dx.doi.org/10.1007/978-1-4842-7422-4_10.

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

Swierstra, S. Doaitse. "Combinator Parsing: A Short Tutorial." In Language Engineering and Rigorous Software Development. Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-03153-3_6.

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

Charguéraud, Arthur. "The Optimal Fixed Point Combinator." In Interactive Theorem Proving. Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-14052-5_15.

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

Hankin, CL, PE Osmon, and MJ Shute. "Cobweb — A combinator reduction architecture." In Functional Programming Languages and Computer Architecture. Springer Berlin Heidelberg, 1985. http://dx.doi.org/10.1007/3-540-15975-4_32.

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

Conference papers on the topic "Y Combinator"

1

De Smedt, Floris, Kristof Van Beeck, Tinne Tuytelaars, and Toon Goedeme. "The Combinator: Optimal Combination of Multiple Pedestrian Detectors." In 2014 22nd International Conference on Pattern Recognition (ICPR). IEEE, 2014. http://dx.doi.org/10.1109/icpr.2014.606.

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

Norman, A. C. "Faster combinator reduction using stock hardware." In the 1988 ACM conference. ACM Press, 1988. http://dx.doi.org/10.1145/62678.62716.

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

Lemaître, M., M. Castan, M. H. Durand, G. Durrieu, and B. Lecussan. "Mechanisms for efficient multiprocessor combinator reduction." In the 1986 ACM conference. ACM Press, 1986. http://dx.doi.org/10.1145/319838.319855.

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

Koopman, P. J., and P. Lee. "A fresh look at combinator graph reduction." In the ACM SIGPLAN 1989 Conference. ACM Press, 1989. http://dx.doi.org/10.1145/73141.74828.

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

Soriano, Jairo, and Juan Chacon. "Concresor based on Kleenean relations using convex combinator." In 2016 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE). IEEE, 2016. http://dx.doi.org/10.1109/fuzz-ieee.2016.7737679.

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

Scholz, Enno. "Imperative streams---a monadic combinator library for synchronous programming." In the third ACM SIGPLAN international conference. ACM Press, 1998. http://dx.doi.org/10.1145/289423.289454.

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

Tarau, Paul. "On Synergies between Type Inference, Generation and Normalization of SK-Combinator Trees." In 2015 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC). IEEE, 2015. http://dx.doi.org/10.1109/synasc.2015.33.

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

Sharma, Dushyant, Rong Gong, James Fosburgh, Stanislav Yu Kruchinin, Patrick A. Naylor, and Ljubomir Milanovic. "Spatial Processing Front-End for Distant ASR Exploiting Self-Attention Channel Combinator." In ICASSP 2022 - 2022 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). IEEE, 2022. http://dx.doi.org/10.1109/icassp43922.2022.9746667.

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

Perera, Lokukaluge P., Kostas Belibassakis, Evangelos Filippas, and Maneesha Premasiri. "Advanced Data Analytics Based Hybrid Engine-Propeller Combinator Diagram for Green Ship Operations." In ASME 2022 41st International Conference on Ocean, Offshore and Arctic Engineering. American Society of Mechanical Engineers, 2022. http://dx.doi.org/10.1115/omae2022-79490.

Full text
Abstract:
Abstract Ship owners should comply with the forthcoming IMO legislations that mandates a reduction of ship emissions of at least 40% by 2030 compared with the 2008 baseline. However, it is unlikely that the shipping industry will be able to achieve its 2030 and 2050 emission reduction targets relying only on existing vessel technologies. Hence, the required green ship technologies that relate to industrial digitalization and AI applications should be utilized onboard vessels to achieve these emission reduction targets. This study proposes to analyze a hybrid engine-propeller combinator diagram
APA, Harvard, Vancouver, ISO, and other styles
10

Perera, Lokukaluge P., and Brage Mo. "Data Analytics for Capturing Marine Engine Operating Regions for Ship Performance Monitoring." In ASME 2016 35th International Conference on Ocean, Offshore and Arctic Engineering. American Society of Mechanical Engineers, 2016. http://dx.doi.org/10.1115/omae2016-54168.

Full text
Abstract:
This study proposes marine engine centered data analytics as a part of the ship energy efficiency management plan (SEEMP) to overcome the current shipping industrial challenges. The SEEMP enforces various emission control measures, where ship energy efficiency should be evaluated by collecting vessel performance and navigation data. That information is used to develop the proposed data analytics that are implemented on the engine-propeller combinator diagram (i.e. one propeller shaft with its own direct drive main engine). Three marine engine operating regions from the initial data analysis ar
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Y Combinator"

1

Winter, Victor Lono. Strategy application, observability, and the choice combinator. Office of Scientific and Technical Information (OSTI), 2004. http://dx.doi.org/10.2172/918743.

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

Kuhn, D. R., M. S. Raunak, and R. N. Kacker. Combination Frequency Differencing. National Institute of Standards and Technology, 2021. http://dx.doi.org/10.6028/nist.cswp.12062021-draft.

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

Diebold, Francis, and Jose Lopez. Forecast Evaluation and Combination. National Bureau of Economic Research, 1996. http://dx.doi.org/10.3386/t0192.

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

Socol, Allison Socol, Ary Amerikaner Amerikaner, Betty Chang Chang, et al. The Education Combination Toolkit. Education Trust, 2020. http://dx.doi.org/10.15868/socialsector.40738.

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

Gildea, Daniel, and Julia Hockenmaier. Identifying Semantic Roles Using Combinatory Categorial Grammar. Defense Technical Information Center, 2003. http://dx.doi.org/10.21236/ada459462.

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

Xiang, Rong. Novel Combination Therapy for Prostate Carcinoma. Defense Technical Information Center, 2005. http://dx.doi.org/10.21236/ada435053.

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

Rennie, Michael W. Mixing Combination and the Acceptance test. Defense Technical Information Center, 1986. http://dx.doi.org/10.21236/ada196499.

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

Xiang, Rong. Novel Combination Therapy for Prostate Carcinoma. Defense Technical Information Center, 2003. http://dx.doi.org/10.21236/ada417972.

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

Xiang, Rong. Novel Combination Therapy for Prostate Carcinoma. Defense Technical Information Center, 2004. http://dx.doi.org/10.21236/ada423719.

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

Ullman, Shimon, and Ronen Basri. Recognition by Linear Combination of Models. Defense Technical Information Center, 1989. http://dx.doi.org/10.21236/ada224268.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Y Combinator' 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