( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Compiling Higher-Order Functions for Tagged-Dataflow.

, и . IFIP PACT, том A-50 из IFIP Transactions, стр. 269-278. North-Holland, (1994)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Ara Panosyan

Ara Panosyan

Anja Panosch

Martin Panosch

Panos Meletis

 

Другие публикации лиц с тем же именем

A Sufficient Condition for Strong Equivalence Under the Well-Founded Semantics., , и . ICLP, том 3668 из Lecture Notes in Computer Science, стр. 414-415. Springer, (2005)Extensional Semantics for Higher-Order Logic Programs with Negation., и . CoRR, (2017)A Game-Theoretic Characterization of Boolean Grammars., , и . Developments in Language Theory, том 5583 из Lecture Notes in Computer Science, стр. 334-347. Springer, (2009)On the expressive power of univariate equations over sets of natural numbers., и . IFIP TCS, том 273 из IFIP, стр. 215-227. Springer, (2008)Fixed-Point Semantics for Non-Monotonic Formalisms.. FICS, стр. 17. Laboratoire d'Informatique Fondamentale de Marseille, (2010)Cactus: A Branching-Time Logic Programming Language., , и . ECSQARU-FAPR, том 1244 из Lecture Notes in Computer Science, стр. 511-524. Springer, (1997)Minimum model semantics for logic programs with negation-as-failure., и . ACM Trans. Comput. Log., 6 (2): 441-467 (2005)Extensional Higher-Order Logic Programming, , , и . CoRR, (2011)An Infinite-Valued Semantics for Logic Programs with Negation., и . JELIA, том 2424 из Lecture Notes in Computer Science, стр. 456-467. Springer, (2002)Extensional Semantics for Higher-Order Logic Programs with Negation., и . JELIA, том 10021 из Lecture Notes in Computer Science, стр. 447-462. (2016)