Übersicht			Auf mobile öffnen

Lieferstatus:	i.d.R. innert 5-10 Tagen versandfertig
Veröffentlichung:	April 2010
Genre:	EDV / Informatik
	Algorithms / constraint / datastructures / Debugging / Design / Künstliche Intelligenz (KI) / Lambdacalculus / Language / Logic / logicprogramming / Logikprogrammierung / Lua / Programming / proving / Software / Software Engineering / Softwareengineering / Theoretische Informatik mehr...
ISBN:	9783642119989
EAN-Code:	9783642119989
Verlag:	Springer
Einband:	Kartoniert
Sprache:	English
Serie:	#5979 - Lecture Notes in Computer Science Theoretical Computer Science and General Issues
Dimensionen:	H 235 mm / B 155 mm / D 11 mm
Gewicht:	300 gr
Seiten:	192
Bewertung:	Titel bewerten / Meinung schreiben

Inhalt:

Invited Papers.- Programming with Multiple Paradigms in Lua.- Constraint Based Strategies.- Contributed Papers.- Integrating ILOG CP Technology into .- Termination of Context-Sensitive Rewriting with Built-In Numbers and Collection Data Structures.- Semantic Labelling for Proving Termination of Combinatory Reduction Systems.- A Taxonomy of Some Right-to-Left String-Matching Algorithms.- Type Checking and Inference Are Equivalent in Lambda Calculi with Existential Types.- Fast and Accurate Strong Termination Analysis with an Application to Partial Evaluation.- New Results on Type Systems for Functional Logic Programming.- A Simple Region Inference Algorithm for a First-Order Functional Language.- A Theoretical Framework for the Declarative Debugging of Functional Logic Programs with Lambda Abstractions.