Zobrazeno 1 - 10
of 47
pro vyhledávání: '"Algebra of programming"'
Autor:
Pinho, Alexandre Mendonça
Dissertação mestrado integrado em Informatics Engineering
The mathematical study of the greedy algorithm provides a blueprint for the study of Dynamic Programming (DP), whose body of knowledge is largely unorganized, remaining obscure to a lar
The mathematical study of the greedy algorithm provides a blueprint for the study of Dynamic Programming (DP), whose body of knowledge is largely unorganized, remaining obscure to a lar
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______307::b442f03b52e0c6942754af93e751eab2
https://hdl.handle.net/1822/83246
https://hdl.handle.net/1822/83246
Autor:
Marshall, Daniel, Orchard, Dominic
In functional programming, regular types are a subset of algebraic data types formed from products and sums with their respective units. One can view regular types as forming a commutative semiring but where the usual axioms are isomorphisms rather t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2ea5ecf38c673d2e89d92edef4a68c8e
Autor:
Marshall, Daniel, Orchard, Dominic
In functional programming, regular types are a subset of algebraic data types formed from products and sums with their respective units. One can view regular types as forming a commutative semiring but where the usual axioms are isomorphisms rather t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::eeb6764ed0fc4b8e460a837e34859cc8
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Miguel Ferreira, José Nuno Oliveira
Publikováno v:
Repositório Científico de Acesso Aberto de Portugal
Repositório Científico de Acesso Aberto de Portugal (RCAAP)
instacron:RCAAP
Repositório Científico de Acesso Aberto de Portugal (RCAAP)
instacron:RCAAP
Relational algebra offers to software engineering the same degree of conciseness and calculational power as linear algebra in other engineering disciplines. Binary relations play the role of matrices with similar emphasis on multiplication and transp
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0a20c844e342950ce68657d996e60190
https://doi.org/10.1109/tse.2012.15
https://doi.org/10.1109/tse.2012.15
We introduce an expression syntax for the evaluation of matrix–matrix, matrix–vector and vector–vector operations. The implementation is similar to the well-known general concept of expression templates as used, for example, in the C++ linear-a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5dc6081190cc4a7d0899b72c6b53d95c
http://hdl.handle.net/20.500.11767/11950
http://hdl.handle.net/20.500.11767/11950
Autor:
José Nuno Oliveira
Publikováno v:
Repositório Científico de Acesso Aberto de Portugal
Repositório Científico de Acesso Aberto de Portugal (RCAAP)
instacron:RCAAP
Repositório Científico de Acesso Aberto de Portugal (RCAAP)
instacron:RCAAP
The Algebra of Programming (AoP) is a discipline for programming from specifications using relation algebra. Specification vagueness and nondeterminism are captured by relations. (Final) implemen- tations are functions. Probabilistic functions are ha
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::dfb5f99f0bf1dc16e640abd9d3c6b89a
https://doi.org/10.1007/s00165-012-0240-9
https://doi.org/10.1007/s00165-012-0240-9
Autor:
Bernhard K. Aichernig, Jifeng He
Publikováno v:
Electronic Notes in Theoretical Computer Science. 187:125-143
This paper presents a theory of testing that integrates into Hoare and He's Unifying Theory of Programming (UTP). We give test cases a denotational semantics by viewing them as specification predicates. This reformulation of test cases allows for rel
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d34026c5d06a5271aba9f43aca9a0f5c
https://doi.org/10.1016/j.entcs.2006.08.048
https://doi.org/10.1016/j.entcs.2006.08.048
Autor:
Oliveira, José Nuno Fonseca
This paper introduces the metaphorism pattern of relational specification and addresses how specification following this pattern can be refined into recursive programs. Metaphorisms express input-output relationships which preserve relevant informati
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______307::aecea80caeb63dd5930085941401d979
https://hdl.handle.net/1822/40616
https://hdl.handle.net/1822/40616
Kniha
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.