Zobrazeno 1 - 10
of 55
pro vyhledávání: '"Naish, Lee"'
Autor:
Naish, Lee
Pawns is a programming language under development which supports pure functional programming (including algebraic data types, higher order programming and parametric polymorphism) and imperative programming (including pointers, destructive update of
Externí odkaz:
http://arxiv.org/abs/2409.03152
Autor:
Naish, Lee
Pawns is a programming language under development that supports algebraic data types, polymorphism, higher order functions and "pure" declarative programming. It also supports impure imperative features including destructive update of shared data str
Externí odkaz:
http://arxiv.org/abs/2409.02398
We re-examine the 2012 local government elections in New South Wales, Australia. The count was conducted electronically using a randomised form of the Single Transferable Vote (STV). It was already well known that randomness does make a difference to
Externí odkaz:
http://arxiv.org/abs/1611.02015
Autor:
Naish, Lee, Søndergaard, Harald
Publikováno v:
Theory and Practice of Logic Programming 14 (2014) 803-840
The semantics of logic programs was originally described in terms of two-valued logic. Soon, however, it was realised that three-valued logic had some natural advantages, as it provides distinct values not only for truth and falsehood, but also for "
Externí odkaz:
http://arxiv.org/abs/1305.0141
Autor:
Naish, Lee
Publikováno v:
Theory and Practice of Logic Programming 14 (2014) 215-238
We show how logic programs with "delays" can be transformed to programs without delays in a way which preserves information concerning floundering (also known as deadlock). This allows a declarative (model-theoretic), bottom-up or goal independent ap
Externí odkaz:
http://arxiv.org/abs/1207.6816
Autor:
Naish, Lee
Many logic programming languages have delay primitives which allow coroutining. This introduces a class of bug symptoms -- computations can flounder when they are intended to succeed or finitely fail. For concurrent logic programs this is normally ca
Externí odkaz:
http://arxiv.org/abs/0711.0048
Autor:
Naish, Lee
Publikováno v:
Theory and Practice of Logic Programming 6(5), September 2006, pp. 509-538.
This paper describes a simpler way for programmers to reason about the correctness of their code. The study of semantics of logic programs has shown strong links between the model theoretic semantics (truth and falsity of atoms in the programmer's in
Externí odkaz:
http://arxiv.org/abs/cs/0508004
Autor:
Pope, Bernard, Naish, Lee
Publikováno v:
In Electronic Notes in Theoretical Computer Science September 2002 64:277-291
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.
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.