Увійти

Готові списки джерел за темами / Declarative programming

Добірка наукової літератури з теми "Declarative programming"

Автор: Grafiati

Опубліковано: 4 червня 2021

Оновлено: 30 липня 2024

Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями

Оберіть тип джерела:

Зміст

Статті в журналах
Дисертації
Книги
Частини книг
Тези доповідей конференцій

Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Declarative programming".

Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.

Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.

Статті в журналах з теми "Declarative programming"

1

Crossley, John N. "Declarative programming." Electronic Notes in Theoretical Computer Science 61 (January 2002): 20. http://dx.doi.org/10.1016/s1571-0661(04)00302-0.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

2

BáRány, Vince, Balder Ten Cate, Benny Kimelfeld, Dan Olteanu, and Zografoula Vagena. "Declarative Probabilistic Programming with Datalog." ACM Transactions on Database Systems 42, no. 4 (November 13, 2017): 1–35. http://dx.doi.org/10.1145/3132700.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

3

Hanus, Michael. "Reduction Strategies for Declarative Programming." Electronic Notes in Theoretical Computer Science 57 (December 2001): 184–91. http://dx.doi.org/10.1016/s1571-0661(04)00273-7.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

4

Komorowski, Henryk Jan. "A declarative logic programming environment." Journal of Systems and Software 8, no. 2 (March 1988): 77–89. http://dx.doi.org/10.1016/0164-1212(88)90002-7.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

5

Lloyd, J. W., and K. S. Ng. "Declarative programming for agent applications." Autonomous Agents and Multi-Agent Systems 23, no. 2 (June 8, 2010): 224–72. http://dx.doi.org/10.1007/s10458-010-9138-1.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

6

Schor, Marshall I. "Declarative Knowledge Programming: Better Than Procedural?" IEEE Expert 1, no. 1 (April 1986): 36–43. http://dx.doi.org/10.1109/mex.1986.5006497.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

7

Louridas, Panagiotis. "Declarative GUI Programming in Microsoft Windows." IEEE Software 24, no. 4 (July 2007): 16–19. http://dx.doi.org/10.1109/ms.2007.105.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

8

Lloyd, John W. "Declarative programming for artificial intelligence applications." ACM SIGPLAN Notices 42, no. 9 (October 2007): 123–24. http://dx.doi.org/10.1145/1291220.1291152.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

9

Finkelstein, Stacy E., Peter Freyd, and James Lipton. "A new framework for declarative programming." Theoretical Computer Science 300, no. 1-3 (May 2003): 91–160. http://dx.doi.org/10.1016/s0304-3975(01)00308-5.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

10

Echahed, Rachid, and Wendelin Serwe. "Defining Actions in Concurrent Declarative Programming." Electronic Notes in Theoretical Computer Science 64 (September 2002): 176–94. http://dx.doi.org/10.1016/s1571-0661(04)80350-5.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Більше джерел

Дисертації з теми "Declarative programming"

1

Clare, A. R. "Evaluating declarative programming." Thesis, University of East Anglia, 1988. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.235233.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

2

Milicevic, Aleksandar Ph D. Massachusetts Institute of Technology. "Advancing declarative programming." Thesis, Massachusetts Institute of Technology, 2015. http://hdl.handle.net/1721.1/99835.

Повний текст джерела

Анотація:

Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2015.
Cataloged from PDF version of thesis.
Includes bibliographical references (pages 141-153).
This thesis attempts to unite and consolidate two large and often culturally disjoint programming paradigms: declarative (focusing on specifying what a program is supposed to do, e.g., shuffle an array so that its elements are ordered) and imperative (detailing how the program intention is to be implemented, e.g., by applying the QuickSort algorithm). The ultimate result of such an effort would be a unified programming environment in which both paradigms are seamlessly integrated, specifications are fully and efficiently executable, and programs are written by freely mixing imperative statements and declarative specifications. With the advent of automated constraint solving, executing declarative specifications as standalone programs has become feasible. A number of challenges still remain. To achieve full automation, constraint solvers often impose restrictions on specification languages and their expressiveness; compromises are also made when integrating a (typically logic-based) specification language with a traditional procedural programming language; and finally, applicability is usually limited to specialized algorithmic domains (for which constraint solving is particularly suitable) and programmers comfortable with writing formal logic. This thesis proposes several advances to address these issues. First, a novel constraint solving framework is presented, Alloy*, the first of its kind capable of automatically and reliably solving arbitrary higher-order formulas (written in standard predicate logic) over bounded domains. Second, a new approach to integrating a specification and an implementation language is proposed, where Alloy, a relational logic-based modeling and specification language, is deeply embedded in Ruby. The resulting platform, called [alpha]Rby, uses Alloy* as its back end, and serves both as an Alloy modeling environment with added Ruby scripting layer around it, and as a Ruby programming environment with added executable specifications. Third, the general idea of declarative programming (focusing on what instead of how) is applied to web programming, producing SUNNY, a model-based reactive web framework with a clear separation between data, events (business logic), and security policies. SUNNY is (1) policy-agnostic-allows security policies to be specified individually and independently from the rest of the code, (2) reactive-automatically propagates data updates to all connected clients while enforcing the security policies, (3) mostly declarative-offers a unified sequential view of the entire distributed web system, allowing events to be implemented only in terms of simple modifications to the data model.
by Aleksandar Milicevic.
Ph. D.

Стилі APA, Harvard, Vancouver, ISO та ін.

3

Chronaki, Catherine Eleftherios. "Parallelism in declarative languages /." Online version of thesis, 1990. http://hdl.handle.net/1850/10793.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

4

Taylor, Frank Stephen. "Parallel functional programming by declarative partitioning." Thesis, Imperial College London, 1997. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.264268.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

5

Bowers, Antony Francis. "Effective meta-programming in declarative languages." Thesis, University of Bristol, 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.263891.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

6

Belaid, Mohamed-Bachir. "Declarative Itemset Mining Based on Constraint Programming." Thesis, Montpellier, 2020. http://www.theses.fr/2020MONTS004.

Повний текст джерела

Анотація:

La fouille de données est l'art de découvrir des informations à partir de bases de données.L'utilisateur spécifie le type de motifs à extraire et le spécialiste utilise des techniques pour trouver les motifs requis.De nombreuses techniques ont été introduites pour l'extraction des motifs classiques tels que les motifs fréquents, les règles d'association, etc.Cependant, l'extraction des motifs avec des propriétés supplémentaires restent un problème pour les spécialistes car des efforts algorithmiques sont requises pour gérer ces propriétés.Récemment, les chercheurs ont profité de la flexibilité de la programmation par contraintes pour modéliser plusieurs problèmes de la fouille de données.En termes de temps d'exécution, les méthodes basées sur la programmation par contraintes ne sont pas encore concurrentes avec les algorithmes spécialisées.Cependant, leur flexibilité permet la modélisation des requêtes complexes sans la nécessité de réviser le processus de résolution.Dans cette thèse, nous proposons d’utiliser la programmation par contraintes pour résoudre des problèmes de la fouille de données.Notre première contribution est un modèle basé sur la programmation par contraintes pour l'extraction des règles d'association.Pour mettre en œuvre notre modèle, nous introduisons une nouvelle contrainte globale,CONFIDENT, pour assurer la confiance des règles.Nous prouvons que propager complètement CONFIDENT est NP-difficile.Nous fournissons donc un propagateur non-complet et une décomposition pour la contrainte CONFIDENT.Nous capturons également les règles minimales non redondantes, une représentation condensée des règles d'association, en introduisant la contrainte globale GENERATOR. GENERATOR est utilisé pour extraire des motifs qui sont des générateurs. Pour cette contrainte, nous proposons un propagateur polynomial complet.Notre deuxième contribution est un model générique basé sur la programmation par contraintes permettant l'extraction des deux frontières des motifs fréquents, à savoir la frontière positive ou les motifs maximaux fréquents et la frontière négative ou les motifs minimaux infréquents.Il est facile de choisir la frontière à extraire en fixant un simple paramètre.Pour cela, nous introduisons deux nouvelles contraintes globales, FREQUENTSUBS et INFREQUENTSUPERS,avec des propagateurs polynomiaux complets.Nous examinons ensuite le problème de l'extraction des frontières avec des contraintes supplémentaires.Nous prouvons que ce problème est coNP-difficile. Cela implique qu’il n’existe aucun CSP représentant ce problème (sauf si coNP est dans NP)
Data mining is the art of discovering knowledge from databases. The user specifies the type of patterns to be mined, and the miner uses techniques to find the required patterns. Many techniques have been introduced for mining traditional patterns like frequent itemsets, association rules, etc. However, mining patterns with additional properties remains a bottleneck for specialists nowadays due to the algorithmic effort needed to handle these properties.Recently, researchers have taken advantage of the flexibility of constraint programming to model various data mining problems. In terms of CPU time, constraint programming-based methods have not yet competed with ad hoc algorithms. However, their flexibility allows the modeling of complex user queries without revising the solving process.In this thesis we propose to use constraint programming for modeling and solving some well known data mining problems.Our first contribution is a constraint programming model for mining association rules. To implement our model, we introduce a new global constraint, CONFIDENT, for ensuring the confidence of rules.We prove that completely propagating CONFIDENT is NP-hard. We thus provide a non-complete propagator and a decomposition for CONFIDENT. We also capture the minimal non-redundant rules, a condensed representation of association rules, by introducing the global constraint GENERATOR. GENERATOR is used for mining itemsets that are generators. For this constraint, we propose a complete polynomial propagator.Our second contribution is a generic framework based on constraint programming to mine both borders of frequent itemsets, i.e. the positive border or maximal frequent itemsets and the negative border or minimal infrequent itemsets. One can easily decide which border to mine by setting a simple parameter. For this, we introduce two new global constraints, FREQUENTSUBS and INFREQUENTSUPERS, with complete polynomial propagators. We then consider the problem of mining borders with additional constraints. We prove that this problem is coNP-hard, ruling out the hope for the existence of a single CSP solving this problem (unless coNP is in NP)

Стилі APA, Harvard, Vancouver, ISO та ін.

7

Seres, Silvija. "The algebra of logic programming." Thesis, University of Oxford, 2001. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.365466.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

8

Hanus, Michael, and Sven Koschnicke. "An ER-based framework for declarative web programming." Universität Potsdam, 2010. http://opus.kobv.de/ubp/volltexte/2010/4144/.

Повний текст джерела

Анотація:

We describe a framework to support the implementation of web-based systems to manipulate data stored in relational databases. Since the conceptual model of a relational database is often specified as an entity-relationship (ER) model, we propose to use the ER model to generate a complete implementation in the declarative programming language Curry. This implementation contains operations to create and manipulate entities of the data model, supports authentication, authorization, session handling, and the composition of individual operations to user processes. Furthermore and most important, the implementation ensures the consistency of the database w.r.t. the data dependencies specified in the ER model, i.e., updates initiated by the user cannot lead to an inconsistent state of the database. In order to generate a high-level declarative implementation that can be easily adapted to individual customer requirements, the framework exploits previous works on declarative database programming and web user interface construction in Curry.

Стилі APA, Harvard, Vancouver, ISO та ін.

9

Machado, Rui Mário da Silva. "Massivel y parallel declarative computational models." Doctoral thesis, Universidade de Évora, 2013. http://hdl.handle.net/10174/12063.

Повний текст джерела

Анотація:

Current computer archictectures are parallel, with an increasing number of processors. Parallel programming is an error-prone task and declarative models such as those based on constraints relieve the programmer from some of its difficult aspects, because they abstract control away. In this work we study and develop techniques for declarative computational models based on constraints using GPI, aiming at large scale parallel execution. The main contributions of this work are: A GPI implementation of a scalable dynamic load balancing scheme based on work stealing, suitable for tree shaped computations and effective for systems with thousands of threads. A parallel constraint solver, MaCS, implemented to take advantage of the GPI programming model. Experimental evaluation shows very good scalability results on systems with hundreds of cores. A GPI parallel version of the Adaptive Search algorithm, including different variants. The study on different problems advances the understanding of scalability issues known to exist with large numbers of cores; ### SUMÁRIO: Actualmente as arquitecturas de computadores são paralelas, com um crescente número de processadores. A programação paralela é uma tarefa propensa a erros e modelos declarativos baseados em restrições aliviam o programador de aspectos difíceis dado que abstraem o controlo. Neste trabalho estudamos e desenvolvemos técnicas para modelos de computação declarativos baseados em restrições usando o GPI, uma ferramenta e modelo de programação recente. O Objectivo é a execução paralela em larga escala. As contribuições deste trabalho são as seguintes: a implementação de um esquema dinâmico para balanceamento da computação baseado no GPI. O esquema é adequado para computações em árvores e efectiva em sistemas compostos por milhares de unidades de computação. Uma abordagem à resolução paralela de restrições denominadas de MaCS, que tira partido do modelo de programação do GPI. A Avaliação experimental revelou boa escalabilidade num sistema com centenas de processadores. Uma versão paralela do algoritmo Adaptive Search baseada no GPI, que inclui diferentes variantes. O estudo de diversos problemas aumenta a compreensão de aspectos relacionados com a escalabilidade e presentes na execução deste tipo de algoritmos num grande número de processadores.

Стилі APA, Harvard, Vancouver, ISO та ін.

10

Fink, Michael [Verfasser]. "Declarative Logic-Programming Components for Information Agents / Michael Fink." Hamburg : Diplom.de, 2002. http://d-nb.info/1184904553/34.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Більше джерел

Книги з теми "Declarative programming"

1

Palamidessi, Catuscia, Hugh Glaser, and Karl Meinke, eds. Principles of Declarative Programming. Berlin, Heidelberg: Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/bfb0056603.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

2

Darlington, John, and Roland Dietrich, eds. Declarative Programming, Sasbachwalden 1991. London: Springer London, 1992. http://dx.doi.org/10.1007/978-1-4471-3794-8.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

3

Seipel, Dietmar, Michael Hanus, and Salvador Abreu, eds. Declarative Programming and Knowledge Management. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-030-00801-7.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

4

Hanus, Michael, and Ricardo Rocha, eds. Declarative Programming and Knowledge Management. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-08909-6.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

5

Umeda, Masanobu, Armin Wolf, Oskar Bartenstein, Ulrich Geske, Dietmar Seipel, and Osamu Takata, eds. Declarative Programming for Knowledge Management. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11963578.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

6

Hofstedt, Petra, Salvador Abreu, Ulrich John, Herbert Kuchen, and Dietmar Seipel, eds. Declarative Programming and Knowledge Management. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-46714-2.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

7

Nadathur, Gopalan, ed. Principles and Practice of Declarative Programming. Berlin, Heidelberg: Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/10704567.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

8

Artemʹeva, I. L. Rasshirennai͡a modelʹ deklarativnykh produkt͡siĭ. Vladivostok: IAPU DVO AN SSSR, 1991.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

9

Seipel, Dietmar, Michael Hanus, and Armin Wolf, eds. Applications of Declarative Programming and Knowledge Management. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-00675-3.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

10

Abreu, Salvador, and Dietmar Seipel, eds. Applications of Declarative Programming and Knowledge Management. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-20589-7.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Більше джерел

Частини книг з теми "Declarative programming"

1

Sheu, Phillip C. Y. "Declarative Programming." In Software Engineering and Environment, 181–206. Boston, MA: Springer US, 1997. http://dx.doi.org/10.1007/978-1-4615-5907-8_7.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

2

Molyneux, Phil. "Declarative Programming." In Managing with Information Technology, 5–17. London: Springer London, 1993. http://dx.doi.org/10.1007/978-1-4471-3299-8_1.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

3

Weik, Martin H. "declarative programming language." In Computer Science and Communications Dictionary, 371. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/1-4020-0613-6_4527.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

4

Thielscher, Michael. "Declarative Action Programs." In ACTION PROGRAMMING LANGUAGES, 51–68. Cham: Springer International Publishing, 2008. http://dx.doi.org/10.1007/978-3-031-01547-2_5.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

5

Pope, Bernard. "Declarative Debugging with Buddha." In Advanced Functional Programming, 273–308. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11546382_7.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

6

van Delft, Andre, and Anatoliy Kmetyuk. "Declarative Programming with Algebra." In Functional and Logic Programming, 232–51. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-29604-3_15.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

7

Tsadok, Avi. "Concurrency and Declarative Programming." In Unleash Core Data, 173–97. Berkeley, CA: Apress, 2022. http://dx.doi.org/10.1007/978-1-4842-8211-3_8.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

8

Magalhães, José Pedro, and Andres Löh. "Generic Generic Programming." In Practical Aspects of Declarative Languages, 216–31. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-04132-2_15.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

9

Darlington, John, Yike Guo, and Helen Pull. "Introducing Constraint Functional Logic Programming." In Declarative Programming, Sasbachwalden 1991, 20–34. London: Springer London, 1992. http://dx.doi.org/10.1007/978-1-4471-3794-8_2.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

10

Cui, Baoqiu, Yifei Dong, Xiaoqun Du, K. Narayan Kumar, C. R. Ramakrishnan, I. V. Ramakrishnan, Abhik Roychoudhury, Scott A. Smolka, and David S. Warren. "Logic programming and model checking." In Principles of Declarative Programming, 1–20. Berlin, Heidelberg: Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/bfb0056604.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Тези доповідей конференцій з теми "Declarative programming"

1

Mancilla, Blanca, and John Plaice. "Declarative Multithreaded Programming." In 2009 33rd Annual IEEE International Computer Software and Applications Conference. IEEE, 2009. http://dx.doi.org/10.1109/compsac.2009.140.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

2

Nilsson, Henrik, and Ivan Perez. "Declarative Game Programming." In the 16th International Symposium. New York, New York, USA: ACM Press, 2014. http://dx.doi.org/10.1145/2643135.2643160.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

3

Guedes, Álan L. V., and Sergio Colcher. "Declarative programming of TV applications using NCL." In Declarative Amsterdam. Amsterdam: John Benjamins, 2020. http://dx.doi.org/10.1075/da.2020.guedes.tv-application.

Повний текст джерела

Анотація:

Abstract NCL is the declarative programming language used to develop TV applications in IPTV systems and Terrestrial TV standardized by ITU and Brazilian TV Forum, respectively. Its main characteristics are: defining temporal synchronization among media assets and viewer interactions; layout reuse facilities; support multi-device presentation; support embed HTML code and scripts in the lightweight scripting language Lua; and an API for life-cycle controls (start, pause, resume, stop) and modifying applications on-the-fly called NCL editing command. This talk briefly introduces NCL, highlights its recent advances, and discuss the future of the language.

Стилі APA, Harvard, Vancouver, ISO та ін.

4

Reynders, Bob, and Kwanghoon Choi. "Rec.HTML: Declarative HTML." In Programming '21: 5th International Conference on the Art, Science, and Engineering of Programming. New York, NY, USA: ACM, 2021. http://dx.doi.org/10.1145/3464432.3464779.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

5

Leuschel, Michael. "Declarative programming for verification." In the 10th international ACM SIGPLAN symposium. New York, New York, USA: ACM Press, 2008. http://dx.doi.org/10.1145/1389449.1389450.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

6

Elliott, Conal. "Declarative event-oriented programming." In the 2nd ACM SIGPLAN international conference. New York, New York, USA: ACM Press, 2000. http://dx.doi.org/10.1145/351268.351276.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

7

Aref, Molham. "Declarative programming for the cloud." In the 2013 companion publication for conference. New York, New York, USA: ACM Press, 2013. http://dx.doi.org/10.1145/2508075.2508190.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

8

Suo, Kun, Wenwu Qu, and Ainhoa Bengoetxea Iriondo. "Declarative programming of network protocols." In 2010 12th IEEE International Conference on Communication Technology (ICCT). IEEE, 2010. http://dx.doi.org/10.1109/icct.2010.5689211.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

9

"ARCHITECTURAL DESIGN VIA DECLARATIVE PROGRAMMING." In 9th International Conference on Enterprise Information Systems. SciTePress - Science and and Technology Publications, 2007. http://dx.doi.org/10.5220/0002346503630369.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

10

Adelsberger, Stephan, Anton Setzer, and Eric Walkingshaw. "Declarative GUIs." In PPDP '18: The 20th International Symposium on Principles and Practice of Declarative Programming. New York, NY, USA: ACM, 2018. http://dx.doi.org/10.1145/3236950.3236962.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Ми пропонуємо знижки на всі преміум-плани для авторів, чиї праці увійшли до тематичних добірок літератури. Зв'яжіться з нами, щоб отримати унікальний промокод!