H ?
«
‹
←
→
›
»
Language peer sets for Escher: United Kingdom↑ United Kingdom/1995↑ Designed 1995 ↑ 1990s languages ↑ Fifth generation↑ Post-Cold War↑ Escher(ID:1770/esc003)alternate simple viewCountry: United Kingdom Designed 1995 Published: 1995 declarative, general-purpose language which integrates the best features of both functional and logic programming languages. It has types and modules, higher-practicalorder and meta-programming facilities, and declarative input/output. It also has a collection of system modules, providing numerous operations on standard data types such as integers, lists, characters, strings, sets, and programs. The main design aim is to combine in a practical and comprehensive way the best ideas of existing functional and logic languages, such as GOEDEL, HASKELL, and LAMBDA PROLOG. Indeed, it goes well beyond GÖDEL in it's ability to allow function definitions, it's higher-order facilities, it's improved handling definitions, it's improved handling of sets, and it's declarative I/O. It goes well beyond HASKELL in it's ability to run partly-instantiated predicate calls, a familiar feature of logic languages which provides a form of non-deterimism, and it's more flexible handling of equality. The language also has clean semantics Structures: Related languages
References: in (1995) Machine Intelligence 15 K. Furukawa, D. Michie, and S. Muggleton (eds). Oxford University Press 1995 in (1995) Machine Intelligence 15 K. Furukawa, D. Michie, and S. Muggleton (eds). Oxford University Press 1995 in (1995) Machine Intelligence 15 K. Furukawa, D. Michie, and S. Muggleton (eds). Oxford University Press 1995 in (1995) Machine Intelligence 15 K. Furukawa, D. Michie, and S. Muggleton (eds). Oxford University Press 1995 Search in: Google Google scholar World Cat Yahoo Overture DBLP Monash bib NZ IEEE  ACM portal CiteSeer CSB ncstrl jstor Bookfinder |