Relevant bibliographies by topics / Programming languages; Homomorphisms

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Book chapters

Academic literature on the topic 'Programming languages; Homomorphisms'

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 'Programming languages; Homomorphisms.'

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 "Programming languages; Homomorphisms"

1

COLE, MURRAY I. "PARALLEL PROGRAMMING WITH LIST HOMOMORPHISMS." Parallel Processing Letters 05, no. 02 (June 1995): 191–203. http://dx.doi.org/10.1142/s0129626495000175.

Full text
Abstract:
We review the use of the Bird-Meertens Formalism as a vehicle for the construction of programs with massive implicit parallelism. We show that a simple result from the theory, concerning the expression of list homomorphisms, can help us in our search for parallel algorithms by suggesting an informal methodology which is applicable when the original result is not, and demonstrate its application to a variety of problems. One of these, a language recognition algorithm, produces a program which exploits nested parallelism. Our main purpose is to show that an understanding of the homomorphism lemma can be helpful in producing parallel programs for problems which are "not quite" list homomorphisms themselves. A more general goal is to illustrate the benefits which can arise from taking a little theory with a pinch of pragmatic salt.
APA, Harvard, Vancouver, ISO, and other styles
2

Manik, Ngarap Im, and Don Tasman. "Piranti Lunak Pengujian Struktur Matematika Grup, Ring, Field Berbasis Osp (Open Source Program)." ComTech: Computer, Mathematics and Engineering Applications 5, no. 1 (June 30, 2014): 373. http://dx.doi.org/10.21512/comtech.v5i1.2631.

Full text
Abstract:
This design of a computer software is a development and continuation of the software made on the previous research (2009/2010). However, this further research developed and expanded the scopes of testing more on the Siclic Group, Isomorphism Group, Semi Group, Sub Group and Abelian Group, Factor Ring, Sub Ring and Polynomial Ring; developed on the OSP (Open Source Program)-based. The software was developed using the OSP-based language programming, such Java, so it is open and free to use for its users. This research succeeded to develop an open source software of Java program that can be used for testing specific mathematical Groups, such Ciclic Group, Isomorphism Group, Semi Group, Sub Group and Abelian Group, and Rings, Commutative Ring, Division Ring, Ideal Sub Ring, Ring Homomorphism, Ring Epimorphism and Fields. By the results, the software developed was able to test as same as the results from manual testing.
APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Programming languages; Homomorphisms"

1

King, Stephen. "Higher-level algorithmic structures in the refinement calculus." Thesis, University of Oxford, 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.300129.

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

Legaux, Joeffrey. "Squelettes algorithmiques pour la programmation et l'exécution efficaces de codes parallèles." Phd thesis, Université d'Orléans, 2013. http://tel.archives-ouvertes.fr/tel-00990852.

Full text
Abstract:
Les architectures parallèles sont désormais présentes dans tous les matériels informatiques, mais les pro- grammeurs ne sont généralement pas formés à leur programmation dans les modèles explicites tels que MPI ou les Pthreads. Il y a un besoin important de modèles plus abstraits tels que les squelettes algorithmiques qui sont une approche structurée. Ceux-ci peuvent être vus comme des fonctions d'ordre supérieur synthétisant le comportement d'algorithmes parallèles récurrents que le développeur peut ensuite combiner pour créer ses programmes. Les développeurs souhaitent obtenir de meilleures performances grâce aux programmes parallèles, mais le temps de développement est également un facteur très important. Les approches par squelettes algorithmiques fournissent des résultats intéressants dans ces deux aspects. La bibliothèque Orléans Skeleton Library ou OSL fournit un ensemble de squelettes algorithmiques de parallélisme de données quasi-synchrones dans le langage C++ et utilise des techniques de programmation avancées pour atteindre une bonne efficacité. Nous avons amélioré OSL afin de lui apporter de meilleures performances et une plus grande expressivité. Nous avons voulu analyser le rapport entre les performances des programmes et l'effort de programmation nécessaire sur OSL et d'autres modèles de programmation parallèle. La comparaison rigoureuse entre des programmes parallèles dans OSL et leurs équivalents de bas niveau montre une bien meilleure productivité pour les modèles de haut niveau qui offrent une grande facilité d'utilisation tout en produisant des performances acceptables.
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Programming languages; Homomorphisms"

1

Amini, Omid, Fedor V. Fomin, and Saket Saurabh. "Counting Subgraphs via Homomorphisms." In Automata, Languages and Programming, 71–82. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-02927-1_8.

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

Chi, Yun-Yan, and Shin-Cheng Mu. "Constructing List Homomorphisms from Proofs." In Programming Languages and Systems, 74–88. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-25318-8_9.

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

Dyer, Martin, Leslie Ann Goldberg, and Mike Paterson. "On Counting Homomorphisms to Directed Acyclic Graphs." In Automata, Languages and Programming, 38–49. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11786986_5.

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

Cai, Jin-Yi, Xi Chen, and Pinyan Lu. "Graph Homomorphisms with Complex Values: A Dichotomy Theorem." In Automata, Languages and Programming, 275–86. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-14165-2_24.

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

Göbel, Andreas, Leslie Ann Goldberg, and David Richerby. "Counting Homomorphisms to Square-Free Graphs, Modulo 2." In Automata, Languages, and Programming, 642–53. Berlin, Heidelberg: Springer Berlin Heidelberg, 2015. http://dx.doi.org/10.1007/978-3-662-47672-7_52.

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

Fomin, Fedor V., Alexander Golovnev, Alexander S. Kulikov, and Ivan Mihajlin. "Lower Bounds for the Graph Homomorphism Problem." In Automata, Languages, and Programming, 481–93. Berlin, Heidelberg: Springer Berlin Heidelberg, 2015. http://dx.doi.org/10.1007/978-3-662-47672-7_39.

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

Delaune, Stéphanie, Pascal Lafourcade, Denis Lugiez, and Ralf Treinen. "Symbolic Protocol Analysis in Presence of a Homomorphism Operator and Exclusive Or." In Automata, Languages and Programming, 132–43. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11787006_12.

Full text
APA, Harvard, Vancouver, ISO, and other styles
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